./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:34:28,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:34:28,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:34:28,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:34:28,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:34:28,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:34:28,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:34:28,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:34:28,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:34:28,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:34:28,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:34:28,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:34:28,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:34:28,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:34:28,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:34:28,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:34:28,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:34:28,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:34:28,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:34:28,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:34:28,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:34:28,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:34:28,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:34:28,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:34:28,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:34:28,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:34:28,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:34:28,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:34:28,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:34:28,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:34:28,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:34:28,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:34:28,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:34:28,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:34:28,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:34:28,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:34:28,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:34:28,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:34:28,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:34:28,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:34:28,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:34:28,149 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:34:28,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:34:28,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:34:28,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:34:28,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:34:28,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:34:28,176 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:34:28,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:34:28,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:34:28,177 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:34:28,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:34:28,177 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:34:28,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:34:28,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:34:28,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:34:28,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:34:28,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:34:28,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:34:28,179 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:34:28,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:34:28,179 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:34:28,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:34:28,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:34:28,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:34:28,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:34:28,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:34:28,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:34:28,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:34:28,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:34:28,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:34:28,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:34:28,181 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:34:28,181 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:34:28,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:34:28,181 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2022-02-20 14:34:28,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:34:28,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:34:28,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:34:28,401 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:34:28,402 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:34:28,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2022-02-20 14:34:28,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2037ad246/2e9cbddccc084d8cb3032bf9757db6bd/FLAG274602090 [2022-02-20 14:34:28,851 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:34:28,851 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2022-02-20 14:34:28,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2037ad246/2e9cbddccc084d8cb3032bf9757db6bd/FLAG274602090 [2022-02-20 14:34:28,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2037ad246/2e9cbddccc084d8cb3032bf9757db6bd [2022-02-20 14:34:28,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:34:28,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:34:28,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:34:28,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:34:28,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:34:28,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:34:28" (1/1) ... [2022-02-20 14:34:28,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b098149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:28, skipping insertion in model container [2022-02-20 14:34:28,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:34:28" (1/1) ... [2022-02-20 14:34:28,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:34:28,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:34:29,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2022-02-20 14:34:29,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:34:29,135 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:34:29,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2022-02-20 14:34:29,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:34:29,198 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:34:29,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:29 WrapperNode [2022-02-20 14:34:29,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:34:29,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:34:29,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:34:29,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:34:29,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:29" (1/1) ... [2022-02-20 14:34:29,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:29" (1/1) ... [2022-02-20 14:34:29,313 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 145 [2022-02-20 14:34:29,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:34:29,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:34:29,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:34:29,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:34:29,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:29" (1/1) ... [2022-02-20 14:34:29,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:29" (1/1) ... [2022-02-20 14:34:29,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:29" (1/1) ... [2022-02-20 14:34:29,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:29" (1/1) ... [2022-02-20 14:34:29,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:29" (1/1) ... [2022-02-20 14:34:29,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:29" (1/1) ... [2022-02-20 14:34:29,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:29" (1/1) ... [2022-02-20 14:34:29,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:34:29,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:34:29,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:34:29,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:34:29,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:29" (1/1) ... [2022-02-20 14:34:29,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:34:29,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:34:29,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:34:29,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:34:29,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:34:29,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:34:29,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:34:29,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:34:29,530 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:34:29,531 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:34:29,969 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:34:29,973 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:34:29,974 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 14:34:29,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:34:29 BoogieIcfgContainer [2022-02-20 14:34:29,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:34:29,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:34:29,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:34:29,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:34:29,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:34:28" (1/3) ... [2022-02-20 14:34:29,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613da056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:34:29, skipping insertion in model container [2022-02-20 14:34:29,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:29" (2/3) ... [2022-02-20 14:34:29,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613da056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:34:29, skipping insertion in model container [2022-02-20 14:34:29,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:34:29" (3/3) ... [2022-02-20 14:34:29,982 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2022-02-20 14:34:29,985 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:34:29,986 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:34:30,033 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:34:30,037 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:34:30,038 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:34:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 50 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:34:30,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:30,062 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:30,063 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:30,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:30,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1979526715, now seen corresponding path program 1 times [2022-02-20 14:34:30,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:30,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135412830] [2022-02-20 14:34:30,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:30,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:30,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {54#true} is VALID [2022-02-20 14:34:30,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {54#true} is VALID [2022-02-20 14:34:30,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume !(0 == mp_add_~a3~0#1 % 256); {54#true} is VALID [2022-02-20 14:34:30,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {54#true} mp_add_~nb~0#1 := 4; {54#true} is VALID [2022-02-20 14:34:30,230 INFO L290 TraceCheckUtils]: 4: Hoare triple {54#true} assume !(0 == mp_add_~b3~0#1 % 256); {54#true} is VALID [2022-02-20 14:34:30,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#true} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {54#true} is VALID [2022-02-20 14:34:30,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {54#true} assume !true; {55#false} is VALID [2022-02-20 14:34:30,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {55#false} assume !true; {55#false} is VALID [2022-02-20 14:34:30,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {55#false} is VALID [2022-02-20 14:34:30,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {55#false} mp_add_#res#1 := mp_add_~r~0#1; {55#false} is VALID [2022-02-20 14:34:30,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {55#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {55#false} is VALID [2022-02-20 14:34:30,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {55#false} assume 0 == __VERIFIER_assert_~cond#1; {55#false} is VALID [2022-02-20 14:34:30,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-02-20 14:34:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:34:30,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:30,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135412830] [2022-02-20 14:34:30,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135412830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:30,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:30,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:34:30,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130461070] [2022-02-20 14:34:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:30,246 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:34:30,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:30,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:30,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:34:30,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:30,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:34:30,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:34:30,290 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 50 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:30,400 INFO L93 Difference]: Finished difference Result 92 states and 160 transitions. [2022-02-20 14:34:30,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:34:30,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:34:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:30,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 160 transitions. [2022-02-20 14:34:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 160 transitions. [2022-02-20 14:34:30,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 160 transitions. [2022-02-20 14:34:30,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:30,587 INFO L225 Difference]: With dead ends: 92 [2022-02-20 14:34:30,588 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 14:34:30,590 INFO L932 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 [2022-02-20 14:34:30,593 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:30,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:34:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 14:34:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 14:34:30,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:30,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 46 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,616 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 46 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,616 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 46 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:30,619 INFO L93 Difference]: Finished difference Result 47 states and 78 transitions. [2022-02-20 14:34:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-02-20 14:34:30,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:30,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:30,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 46 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 47 states. [2022-02-20 14:34:30,623 INFO L87 Difference]: Start difference. First operand has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 46 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 47 states. [2022-02-20 14:34:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:30,627 INFO L93 Difference]: Finished difference Result 47 states and 78 transitions. [2022-02-20 14:34:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-02-20 14:34:30,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:30,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:30,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:30,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 46 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-02-20 14:34:30,635 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 13 [2022-02-20 14:34:30,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:30,635 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-02-20 14:34:30,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,635 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-02-20 14:34:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:34:30,636 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:30,637 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:30,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:34:30,638 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:30,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash 726479629, now seen corresponding path program 1 times [2022-02-20 14:34:30,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:30,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010532401] [2022-02-20 14:34:30,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:30,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:30,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {301#true} is VALID [2022-02-20 14:34:30,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {301#true} is VALID [2022-02-20 14:34:30,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume !(0 == mp_add_~a3~0#1 % 256); {301#true} is VALID [2022-02-20 14:34:30,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {301#true} mp_add_~nb~0#1 := 4; {301#true} is VALID [2022-02-20 14:34:30,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {301#true} assume !(0 == mp_add_~b3~0#1 % 256); {301#true} is VALID [2022-02-20 14:34:30,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {303#(= |ULTIMATE.start_mp_add_~i~0#1| 0)} is VALID [2022-02-20 14:34:30,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {303#(= |ULTIMATE.start_mp_add_~i~0#1| 0)} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {303#(= |ULTIMATE.start_mp_add_~i~0#1| 0)} is VALID [2022-02-20 14:34:30,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {303#(= |ULTIMATE.start_mp_add_~i~0#1| 0)} assume !(mp_add_~i~0#1 % 256 < 4); {302#false} is VALID [2022-02-20 14:34:30,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {302#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {302#false} is VALID [2022-02-20 14:34:30,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {302#false} mp_add_#res#1 := mp_add_~r~0#1; {302#false} is VALID [2022-02-20 14:34:30,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {302#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {302#false} is VALID [2022-02-20 14:34:30,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {302#false} assume 0 == __VERIFIER_assert_~cond#1; {302#false} is VALID [2022-02-20 14:34:30,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-02-20 14:34:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:34:30,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:30,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010532401] [2022-02-20 14:34:30,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010532401] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:30,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:30,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:34:30,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229160131] [2022-02-20 14:34:30,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:30,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:34:30,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:30,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:30,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:34:30,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:30,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:34:30,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:34:30,763 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:30,979 INFO L93 Difference]: Finished difference Result 112 states and 190 transitions. [2022-02-20 14:34:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:34:30,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:34:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2022-02-20 14:34:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2022-02-20 14:34:30,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 190 transitions. [2022-02-20 14:34:31,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:31,125 INFO L225 Difference]: With dead ends: 112 [2022-02-20 14:34:31,126 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 14:34:31,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:34:31,131 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:31,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 87 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:34:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 14:34:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-02-20 14:34:31,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:31,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 73 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 72 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:31,141 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 73 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 72 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:31,142 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 73 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 72 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:31,144 INFO L93 Difference]: Finished difference Result 75 states and 111 transitions. [2022-02-20 14:34:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2022-02-20 14:34:31,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:31,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:31,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 72 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 75 states. [2022-02-20 14:34:31,146 INFO L87 Difference]: Start difference. First operand has 73 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 72 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 75 states. [2022-02-20 14:34:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:31,152 INFO L93 Difference]: Finished difference Result 75 states and 111 transitions. [2022-02-20 14:34:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2022-02-20 14:34:31,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:31,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:31,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:31,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 72 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2022-02-20 14:34:31,155 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 13 [2022-02-20 14:34:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:31,156 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2022-02-20 14:34:31,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2022-02-20 14:34:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:34:31,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:31,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:31,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:34:31,160 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:31,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:31,161 INFO L85 PathProgramCache]: Analyzing trace with hash 727939832, now seen corresponding path program 1 times [2022-02-20 14:34:31,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:31,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910712881] [2022-02-20 14:34:31,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:31,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:31,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {649#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {649#true} is VALID [2022-02-20 14:34:31,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {649#true} is VALID [2022-02-20 14:34:31,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} assume !(0 == mp_add_~a3~0#1 % 256); {649#true} is VALID [2022-02-20 14:34:31,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {649#true} mp_add_~nb~0#1 := 4; {649#true} is VALID [2022-02-20 14:34:31,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {649#true} assume !(0 == mp_add_~b3~0#1 % 256); {649#true} is VALID [2022-02-20 14:34:31,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#true} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {649#true} is VALID [2022-02-20 14:34:31,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {649#true} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {649#true} is VALID [2022-02-20 14:34:31,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#true} assume !!(mp_add_~i~0#1 % 256 < 4); {649#true} is VALID [2022-02-20 14:34:31,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {649#true} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := 0; {651#(<= |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256))} is VALID [2022-02-20 14:34:31,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {651#(<= |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256))} assume !(1 == mp_add_~i~0#1 % 256); {651#(<= |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256))} is VALID [2022-02-20 14:34:31,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {651#(<= |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256))} assume !(2 == mp_add_~i~0#1 % 256); {651#(<= |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256))} is VALID [2022-02-20 14:34:31,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {651#(<= |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256))} assume !(3 == mp_add_~i~0#1 % 256); {651#(<= |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256))} is VALID [2022-02-20 14:34:31,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {651#(<= |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {652#(and (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) 0)) (<= |ULTIMATE.start_mp_add_~i~0#1| 1))} is VALID [2022-02-20 14:34:31,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(and (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) 0)) (<= |ULTIMATE.start_mp_add_~i~0#1| 1))} assume !(mp_add_~i~0#1 % 256 < 4); {650#false} is VALID [2022-02-20 14:34:31,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {650#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {650#false} is VALID [2022-02-20 14:34:31,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {650#false} mp_add_#res#1 := mp_add_~r~0#1; {650#false} is VALID [2022-02-20 14:34:31,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {650#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {650#false} is VALID [2022-02-20 14:34:31,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {650#false} assume 0 == __VERIFIER_assert_~cond#1; {650#false} is VALID [2022-02-20 14:34:31,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-02-20 14:34:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:34:31,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:31,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910712881] [2022-02-20 14:34:31,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910712881] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:31,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:31,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:34:31,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758128749] [2022-02-20 14:34:31,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:31,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 14:34:31,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:31,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:31,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:31,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:34:31,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:31,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:34:31,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:34:31,346 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:31,759 INFO L93 Difference]: Finished difference Result 184 states and 301 transitions. [2022-02-20 14:34:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:34:31,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 14:34:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 277 transitions. [2022-02-20 14:34:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:31,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 277 transitions. [2022-02-20 14:34:31,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 277 transitions. [2022-02-20 14:34:31,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:31,980 INFO L225 Difference]: With dead ends: 184 [2022-02-20 14:34:31,981 INFO L226 Difference]: Without dead ends: 147 [2022-02-20 14:34:31,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:34:31,981 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 116 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:31,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 121 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:34:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-20 14:34:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 101. [2022-02-20 14:34:31,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:31,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 101 states, 100 states have (on average 1.5) internal successors, (150), 100 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:31,990 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 101 states, 100 states have (on average 1.5) internal successors, (150), 100 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:31,990 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 101 states, 100 states have (on average 1.5) internal successors, (150), 100 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:31,993 INFO L93 Difference]: Finished difference Result 147 states and 202 transitions. [2022-02-20 14:34:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 202 transitions. [2022-02-20 14:34:31,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:31,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:31,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 100 states have (on average 1.5) internal successors, (150), 100 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 147 states. [2022-02-20 14:34:31,995 INFO L87 Difference]: Start difference. First operand has 101 states, 100 states have (on average 1.5) internal successors, (150), 100 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 147 states. [2022-02-20 14:34:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:31,998 INFO L93 Difference]: Finished difference Result 147 states and 202 transitions. [2022-02-20 14:34:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 202 transitions. [2022-02-20 14:34:31,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:31,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:31,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:31,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.5) internal successors, (150), 100 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2022-02-20 14:34:32,001 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 19 [2022-02-20 14:34:32,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:32,001 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2022-02-20 14:34:32,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2022-02-20 14:34:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:34:32,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:32,002 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:32,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:34:32,002 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:32,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:32,003 INFO L85 PathProgramCache]: Analyzing trace with hash -302552601, now seen corresponding path program 1 times [2022-02-20 14:34:32,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:32,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950408156] [2022-02-20 14:34:32,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:32,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:32,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {1247#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {1247#true} is VALID [2022-02-20 14:34:32,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {1247#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {1249#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} is VALID [2022-02-20 14:34:32,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {1249#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume !(0 == mp_add_~a3~0#1 % 256); {1249#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} is VALID [2022-02-20 14:34:32,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {1249#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} mp_add_~nb~0#1 := 4; {1249#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} is VALID [2022-02-20 14:34:32,112 INFO L290 TraceCheckUtils]: 4: Hoare triple {1249#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume !(0 == mp_add_~b3~0#1 % 256); {1249#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} is VALID [2022-02-20 14:34:32,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {1249#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {1250#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)))} is VALID [2022-02-20 14:34:32,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {1250#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)))} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {1248#false} is VALID [2022-02-20 14:34:32,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {1248#false} assume !!(mp_add_~i~0#1 % 256 < 4); {1248#false} is VALID [2022-02-20 14:34:32,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {1248#false} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := 0; {1248#false} is VALID [2022-02-20 14:34:32,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {1248#false} assume !(1 == mp_add_~i~0#1 % 256); {1248#false} is VALID [2022-02-20 14:34:32,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {1248#false} assume !(2 == mp_add_~i~0#1 % 256); {1248#false} is VALID [2022-02-20 14:34:32,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {1248#false} assume !(3 == mp_add_~i~0#1 % 256); {1248#false} is VALID [2022-02-20 14:34:32,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {1248#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {1248#false} is VALID [2022-02-20 14:34:32,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {1248#false} assume !!(mp_add_~i~0#1 % 256 < 4); {1248#false} is VALID [2022-02-20 14:34:32,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {1248#false} assume !(0 == mp_add_~i~0#1 % 256); {1248#false} is VALID [2022-02-20 14:34:32,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {1248#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; {1248#false} is VALID [2022-02-20 14:34:32,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {1248#false} assume !(2 == mp_add_~i~0#1 % 256); {1248#false} is VALID [2022-02-20 14:34:32,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {1248#false} assume !(3 == mp_add_~i~0#1 % 256); {1248#false} is VALID [2022-02-20 14:34:32,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {1248#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {1248#false} is VALID [2022-02-20 14:34:32,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {1248#false} assume !(mp_add_~i~0#1 % 256 < 4); {1248#false} is VALID [2022-02-20 14:34:32,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {1248#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {1248#false} is VALID [2022-02-20 14:34:32,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {1248#false} mp_add_#res#1 := mp_add_~r~0#1; {1248#false} is VALID [2022-02-20 14:34:32,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {1248#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1248#false} is VALID [2022-02-20 14:34:32,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {1248#false} assume 0 == __VERIFIER_assert_~cond#1; {1248#false} is VALID [2022-02-20 14:34:32,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {1248#false} assume !false; {1248#false} is VALID [2022-02-20 14:34:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 14:34:32,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:32,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950408156] [2022-02-20 14:34:32,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950408156] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:32,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:32,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:34:32,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956611243] [2022-02-20 14:34:32,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:32,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 14:34:32,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:32,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:32,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:32,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:34:32,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:32,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:34:32,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:34:32,132 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:32,551 INFO L93 Difference]: Finished difference Result 302 states and 441 transitions. [2022-02-20 14:34:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:34:32,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 14:34:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-02-20 14:34:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-02-20 14:34:32,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 237 transitions. [2022-02-20 14:34:32,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:32,754 INFO L225 Difference]: With dead ends: 302 [2022-02-20 14:34:32,754 INFO L226 Difference]: Without dead ends: 214 [2022-02-20 14:34:32,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:34:32,755 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 116 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:32,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 234 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:34:32,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-02-20 14:34:32,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 108. [2022-02-20 14:34:32,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:32,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 108 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 107 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:32,773 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 108 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 107 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:32,773 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 108 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 107 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:32,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:32,780 INFO L93 Difference]: Finished difference Result 214 states and 310 transitions. [2022-02-20 14:34:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 310 transitions. [2022-02-20 14:34:32,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:32,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:32,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 107 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 214 states. [2022-02-20 14:34:32,781 INFO L87 Difference]: Start difference. First operand has 108 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 107 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 214 states. [2022-02-20 14:34:32,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:32,786 INFO L93 Difference]: Finished difference Result 214 states and 310 transitions. [2022-02-20 14:34:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 310 transitions. [2022-02-20 14:34:32,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:32,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:32,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:32,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 107 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2022-02-20 14:34:32,790 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 25 [2022-02-20 14:34:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:32,791 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2022-02-20 14:34:32,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2022-02-20 14:34:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:34:32,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:32,794 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:32,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:34:32,794 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:32,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:32,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1128243813, now seen corresponding path program 1 times [2022-02-20 14:34:32,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:32,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028821031] [2022-02-20 14:34:32,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:32,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:32,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {2109#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {2109#true} is VALID [2022-02-20 14:34:32,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {2109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {2109#true} is VALID [2022-02-20 14:34:32,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {2109#true} assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {2109#true} is VALID [2022-02-20 14:34:32,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {2109#true} assume !(0 == mp_add_~a2~0#1 % 256); {2109#true} is VALID [2022-02-20 14:34:32,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {2109#true} mp_add_~nb~0#1 := 4; {2111#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:32,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {2111#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(0 == mp_add_~b3~0#1 % 256); {2111#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:32,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {2111#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {2112#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~nb~0#1| 256))) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:32,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {2112#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~nb~0#1| 256))) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {2110#false} is VALID [2022-02-20 14:34:32,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {2110#false} assume !!(mp_add_~i~0#1 % 256 < 4); {2110#false} is VALID [2022-02-20 14:34:32,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {2110#false} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := 0; {2110#false} is VALID [2022-02-20 14:34:32,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {2110#false} assume !(1 == mp_add_~i~0#1 % 256); {2110#false} is VALID [2022-02-20 14:34:32,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {2110#false} assume !(2 == mp_add_~i~0#1 % 256); {2110#false} is VALID [2022-02-20 14:34:32,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {2110#false} assume !(3 == mp_add_~i~0#1 % 256); {2110#false} is VALID [2022-02-20 14:34:32,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {2110#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {2110#false} is VALID [2022-02-20 14:34:32,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {2110#false} assume !!(mp_add_~i~0#1 % 256 < 4); {2110#false} is VALID [2022-02-20 14:34:32,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {2110#false} assume !(0 == mp_add_~i~0#1 % 256); {2110#false} is VALID [2022-02-20 14:34:32,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {2110#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; {2110#false} is VALID [2022-02-20 14:34:32,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {2110#false} assume !(2 == mp_add_~i~0#1 % 256); {2110#false} is VALID [2022-02-20 14:34:32,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {2110#false} assume !(3 == mp_add_~i~0#1 % 256); {2110#false} is VALID [2022-02-20 14:34:32,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {2110#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {2110#false} is VALID [2022-02-20 14:34:32,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {2110#false} assume !(mp_add_~i~0#1 % 256 < 4); {2110#false} is VALID [2022-02-20 14:34:32,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {2110#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {2110#false} is VALID [2022-02-20 14:34:32,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {2110#false} mp_add_#res#1 := mp_add_~r~0#1; {2110#false} is VALID [2022-02-20 14:34:32,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {2110#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2110#false} is VALID [2022-02-20 14:34:32,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {2110#false} assume 0 == __VERIFIER_assert_~cond#1; {2110#false} is VALID [2022-02-20 14:34:32,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {2110#false} assume !false; {2110#false} is VALID [2022-02-20 14:34:32,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 14:34:32,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:32,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028821031] [2022-02-20 14:34:32,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028821031] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:32,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:32,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:34:32,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245444791] [2022-02-20 14:34:32,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:32,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 14:34:32,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:32,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:32,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:32,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:34:32,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:32,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:34:32,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:34:32,913 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:33,305 INFO L93 Difference]: Finished difference Result 308 states and 447 transitions. [2022-02-20 14:34:33,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:34:33,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 14:34:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2022-02-20 14:34:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2022-02-20 14:34:33,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 230 transitions. [2022-02-20 14:34:33,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:33,481 INFO L225 Difference]: With dead ends: 308 [2022-02-20 14:34:33,481 INFO L226 Difference]: Without dead ends: 220 [2022-02-20 14:34:33,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:34:33,482 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 111 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:33,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 226 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:34:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-02-20 14:34:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 119. [2022-02-20 14:34:33,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:33,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 119 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 118 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,506 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 119 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 118 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,507 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 119 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 118 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:33,513 INFO L93 Difference]: Finished difference Result 220 states and 316 transitions. [2022-02-20 14:34:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 316 transitions. [2022-02-20 14:34:33,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:33,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:33,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 118 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 220 states. [2022-02-20 14:34:33,514 INFO L87 Difference]: Start difference. First operand has 119 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 118 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 220 states. [2022-02-20 14:34:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:33,520 INFO L93 Difference]: Finished difference Result 220 states and 316 transitions. [2022-02-20 14:34:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 316 transitions. [2022-02-20 14:34:33,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:33,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:33,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:33,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 118 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2022-02-20 14:34:33,525 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 26 [2022-02-20 14:34:33,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:33,525 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2022-02-20 14:34:33,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2022-02-20 14:34:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:34:33,526 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:33,526 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:33,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 14:34:33,526 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1070765944, now seen corresponding path program 1 times [2022-02-20 14:34:33,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:33,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026153111] [2022-02-20 14:34:33,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:33,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:33,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {3004#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {3004#true} is VALID [2022-02-20 14:34:33,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {3004#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {3006#(and (<= (div |ULTIMATE.start_mp_add_~b3~0#1| 256) 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:33,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {3006#(and (<= (div |ULTIMATE.start_mp_add_~b3~0#1| 256) 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {3006#(and (<= (div |ULTIMATE.start_mp_add_~b3~0#1| 256) 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:33,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {3006#(and (<= (div |ULTIMATE.start_mp_add_~b3~0#1| 256) 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(0 == mp_add_~a2~0#1 % 256); {3006#(and (<= (div |ULTIMATE.start_mp_add_~b3~0#1| 256) 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:33,591 INFO L290 TraceCheckUtils]: 4: Hoare triple {3006#(and (<= (div |ULTIMATE.start_mp_add_~b3~0#1| 256) 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} mp_add_~nb~0#1 := 4; {3006#(and (<= (div |ULTIMATE.start_mp_add_~b3~0#1| 256) 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:33,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {3006#(and (<= (div |ULTIMATE.start_mp_add_~b3~0#1| 256) 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; {3005#false} is VALID [2022-02-20 14:34:33,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {3005#false} assume !(0 == mp_add_~b2~0#1 % 256); {3005#false} is VALID [2022-02-20 14:34:33,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {3005#false} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {3005#false} is VALID [2022-02-20 14:34:33,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {3005#false} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {3005#false} is VALID [2022-02-20 14:34:33,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {3005#false} assume !!(mp_add_~i~0#1 % 256 < 4); {3005#false} is VALID [2022-02-20 14:34:33,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {3005#false} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := 0; {3005#false} is VALID [2022-02-20 14:34:33,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {3005#false} assume !(1 == mp_add_~i~0#1 % 256); {3005#false} is VALID [2022-02-20 14:34:33,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {3005#false} assume !(2 == mp_add_~i~0#1 % 256); {3005#false} is VALID [2022-02-20 14:34:33,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {3005#false} assume !(3 == mp_add_~i~0#1 % 256); {3005#false} is VALID [2022-02-20 14:34:33,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {3005#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {3005#false} is VALID [2022-02-20 14:34:33,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {3005#false} assume !!(mp_add_~i~0#1 % 256 < 4); {3005#false} is VALID [2022-02-20 14:34:33,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {3005#false} assume !(0 == mp_add_~i~0#1 % 256); {3005#false} is VALID [2022-02-20 14:34:33,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {3005#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; {3005#false} is VALID [2022-02-20 14:34:33,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {3005#false} assume !(2 == mp_add_~i~0#1 % 256); {3005#false} is VALID [2022-02-20 14:34:33,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {3005#false} assume !(3 == mp_add_~i~0#1 % 256); {3005#false} is VALID [2022-02-20 14:34:33,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {3005#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {3005#false} is VALID [2022-02-20 14:34:33,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {3005#false} assume !(mp_add_~i~0#1 % 256 < 4); {3005#false} is VALID [2022-02-20 14:34:33,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {3005#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {3005#false} is VALID [2022-02-20 14:34:33,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {3005#false} mp_add_#res#1 := mp_add_~r~0#1; {3005#false} is VALID [2022-02-20 14:34:33,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {3005#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3005#false} is VALID [2022-02-20 14:34:33,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {3005#false} assume 0 == __VERIFIER_assert_~cond#1; {3005#false} is VALID [2022-02-20 14:34:33,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {3005#false} assume !false; {3005#false} is VALID [2022-02-20 14:34:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 14:34:33,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:33,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026153111] [2022-02-20 14:34:33,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026153111] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:33,606 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:33,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:34:33,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519479755] [2022-02-20 14:34:33,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:33,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 14:34:33,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:33,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:33,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:34:33,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:33,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:34:33,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:34:33,622 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:33,713 INFO L93 Difference]: Finished difference Result 205 states and 299 transitions. [2022-02-20 14:34:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:34:33,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 14:34:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2022-02-20 14:34:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2022-02-20 14:34:33,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 141 transitions. [2022-02-20 14:34:33,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:33,849 INFO L225 Difference]: With dead ends: 205 [2022-02-20 14:34:33,849 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 14:34:33,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:34:33,851 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 68 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:33,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 72 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:34:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 14:34:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-02-20 14:34:33,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:33,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.438095238095238) internal successors, (151), 105 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,873 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.438095238095238) internal successors, (151), 105 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,873 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.438095238095238) internal successors, (151), 105 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:33,876 INFO L93 Difference]: Finished difference Result 106 states and 151 transitions. [2022-02-20 14:34:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2022-02-20 14:34:33,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:33,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:33,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 105 states have (on average 1.438095238095238) internal successors, (151), 105 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 106 states. [2022-02-20 14:34:33,877 INFO L87 Difference]: Start difference. First operand has 106 states, 105 states have (on average 1.438095238095238) internal successors, (151), 105 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 106 states. [2022-02-20 14:34:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:33,880 INFO L93 Difference]: Finished difference Result 106 states and 151 transitions. [2022-02-20 14:34:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2022-02-20 14:34:33,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:33,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:33,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:33,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.438095238095238) internal successors, (151), 105 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2022-02-20 14:34:33,883 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 27 [2022-02-20 14:34:33,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:33,883 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2022-02-20 14:34:33,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2022-02-20 14:34:33,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:34:33,884 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:33,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:33,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:34:33,885 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:33,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:33,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1640046083, now seen corresponding path program 1 times [2022-02-20 14:34:33,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:33,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449277242] [2022-02-20 14:34:33,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:33,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:33,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {3547#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {3547#true} is VALID [2022-02-20 14:34:33,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {3547#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {3547#true} is VALID [2022-02-20 14:34:33,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {3547#true} assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {3547#true} is VALID [2022-02-20 14:34:33,963 INFO L290 TraceCheckUtils]: 3: Hoare triple {3547#true} assume !(0 == mp_add_~a2~0#1 % 256); {3547#true} is VALID [2022-02-20 14:34:33,964 INFO L290 TraceCheckUtils]: 4: Hoare triple {3547#true} mp_add_~nb~0#1 := 4; {3547#true} is VALID [2022-02-20 14:34:33,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {3547#true} assume !(0 == mp_add_~b3~0#1 % 256); {3547#true} is VALID [2022-02-20 14:34:33,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {3547#true} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {3547#true} is VALID [2022-02-20 14:34:33,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {3547#true} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {3547#true} is VALID [2022-02-20 14:34:33,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {3547#true} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {3547#true} is VALID [2022-02-20 14:34:33,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {3547#true} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {3547#true} is VALID [2022-02-20 14:34:33,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {3547#true} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; {3547#true} is VALID [2022-02-20 14:34:33,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {3547#true} assume !(1 == mp_add_~i~0#1 % 256); {3547#true} is VALID [2022-02-20 14:34:33,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {3547#true} assume !(2 == mp_add_~i~0#1 % 256); {3547#true} is VALID [2022-02-20 14:34:33,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {3547#true} assume !(3 == mp_add_~i~0#1 % 256); {3547#true} is VALID [2022-02-20 14:34:33,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {3547#true} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {3547#true} is VALID [2022-02-20 14:34:33,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {3547#true} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {3547#true} is VALID [2022-02-20 14:34:33,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {3547#true} assume !(1 == mp_add_~i~0#1 % 256); {3547#true} is VALID [2022-02-20 14:34:33,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {3547#true} assume !(2 == mp_add_~i~0#1 % 256); {3547#true} is VALID [2022-02-20 14:34:33,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {3547#true} assume !(3 == mp_add_~i~0#1 % 256); {3547#true} is VALID [2022-02-20 14:34:33,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {3547#true} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {3547#true} is VALID [2022-02-20 14:34:33,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {3547#true} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {3547#true} is VALID [2022-02-20 14:34:33,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {3547#true} assume !!(mp_add_~i~0#1 % 256 < 4); {3547#true} is VALID [2022-02-20 14:34:33,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {3547#true} assume !(0 == mp_add_~i~0#1 % 256); {3547#true} is VALID [2022-02-20 14:34:33,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {3547#true} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; {3549#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 1))} is VALID [2022-02-20 14:34:33,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {3549#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 1))} assume !(2 == mp_add_~i~0#1 % 256); {3549#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 1))} is VALID [2022-02-20 14:34:33,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {3549#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 1))} assume !(3 == mp_add_~i~0#1 % 256); {3549#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 1))} is VALID [2022-02-20 14:34:33,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {3549#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 1))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {3550#(and (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) 0)) (<= |ULTIMATE.start_mp_add_~i~0#1| 2))} is VALID [2022-02-20 14:34:33,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {3550#(and (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) 0)) (<= |ULTIMATE.start_mp_add_~i~0#1| 2))} assume !(mp_add_~i~0#1 % 256 < 4); {3548#false} is VALID [2022-02-20 14:34:33,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {3548#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {3548#false} is VALID [2022-02-20 14:34:33,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {3548#false} mp_add_#res#1 := mp_add_~r~0#1; {3548#false} is VALID [2022-02-20 14:34:33,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {3548#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3548#false} is VALID [2022-02-20 14:34:33,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {3548#false} assume 0 == __VERIFIER_assert_~cond#1; {3548#false} is VALID [2022-02-20 14:34:33,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {3548#false} assume !false; {3548#false} is VALID [2022-02-20 14:34:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:34:33,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:33,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449277242] [2022-02-20 14:34:33,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449277242] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:33,971 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:33,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:34:33,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319979410] [2022-02-20 14:34:33,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:33,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 14:34:33,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:33,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:33,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:33,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:34:33,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:33,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:34:33,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:34:33,994 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:34,367 INFO L93 Difference]: Finished difference Result 300 states and 448 transitions. [2022-02-20 14:34:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:34:34,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 14:34:34,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 265 transitions. [2022-02-20 14:34:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 265 transitions. [2022-02-20 14:34:34,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 265 transitions. [2022-02-20 14:34:34,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:34,568 INFO L225 Difference]: With dead ends: 300 [2022-02-20 14:34:34,568 INFO L226 Difference]: Without dead ends: 214 [2022-02-20 14:34:34,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:34:34,569 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 120 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:34,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 102 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:34:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-02-20 14:34:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 149. [2022-02-20 14:34:34,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:34,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 149 states, 148 states have (on average 1.472972972972973) internal successors, (218), 148 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:34,590 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 149 states, 148 states have (on average 1.472972972972973) internal successors, (218), 148 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:34,591 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 149 states, 148 states have (on average 1.472972972972973) internal successors, (218), 148 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:34,594 INFO L93 Difference]: Finished difference Result 214 states and 300 transitions. [2022-02-20 14:34:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 300 transitions. [2022-02-20 14:34:34,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:34,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:34,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 148 states have (on average 1.472972972972973) internal successors, (218), 148 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 214 states. [2022-02-20 14:34:34,595 INFO L87 Difference]: Start difference. First operand has 149 states, 148 states have (on average 1.472972972972973) internal successors, (218), 148 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 214 states. [2022-02-20 14:34:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:34,598 INFO L93 Difference]: Finished difference Result 214 states and 300 transitions. [2022-02-20 14:34:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 300 transitions. [2022-02-20 14:34:34,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:34,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:34,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:34,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.472972972972973) internal successors, (218), 148 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 218 transitions. [2022-02-20 14:34:34,601 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 218 transitions. Word has length 33 [2022-02-20 14:34:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:34,601 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 218 transitions. [2022-02-20 14:34:34,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 218 transitions. [2022-02-20 14:34:34,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 14:34:34,602 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:34,602 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:34,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 14:34:34,602 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:34,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:34,603 INFO L85 PathProgramCache]: Analyzing trace with hash -84755096, now seen corresponding path program 1 times [2022-02-20 14:34:34,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:34,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280398522] [2022-02-20 14:34:34,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:34,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:34,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {4448#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {4448#true} is VALID [2022-02-20 14:34:34,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {4448#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {4448#true} is VALID [2022-02-20 14:34:34,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {4448#true} assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {4448#true} is VALID [2022-02-20 14:34:34,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {4448#true} assume !(0 == mp_add_~a2~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:34,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {4448#true} mp_add_~nb~0#1 := 4; {4450#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:34,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {4450#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(0 == mp_add_~b3~0#1 % 256); {4450#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:34,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {4450#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(1 == mp_add_~i~0#1 % 256); {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(2 == mp_add_~i~0#1 % 256); {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(3 == mp_add_~i~0#1 % 256); {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(1 == mp_add_~i~0#1 % 256); {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(2 == mp_add_~i~0#1 % 256); {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(3 == mp_add_~i~0#1 % 256); {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {4451#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {4452#(<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~nb~0#1|)} is VALID [2022-02-20 14:34:34,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {4452#(<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~nb~0#1|)} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {4453#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} is VALID [2022-02-20 14:34:34,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {4453#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} assume !!(mp_add_~i~0#1 % 256 < 4); {4453#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} is VALID [2022-02-20 14:34:34,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {4453#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} assume !(0 == mp_add_~i~0#1 % 256); {4453#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} is VALID [2022-02-20 14:34:34,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {4453#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; {4449#false} is VALID [2022-02-20 14:34:34,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {4449#false} assume !(2 == mp_add_~i~0#1 % 256); {4449#false} is VALID [2022-02-20 14:34:34,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {4449#false} assume !(3 == mp_add_~i~0#1 % 256); {4449#false} is VALID [2022-02-20 14:34:34,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {4449#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {4449#false} is VALID [2022-02-20 14:34:34,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {4449#false} assume !!(mp_add_~i~0#1 % 256 < 4); {4449#false} is VALID [2022-02-20 14:34:34,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {4449#false} assume !(0 == mp_add_~i~0#1 % 256); {4449#false} is VALID [2022-02-20 14:34:34,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {4449#false} assume !(1 == mp_add_~i~0#1 % 256); {4449#false} is VALID [2022-02-20 14:34:34,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {4449#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := 0; {4449#false} is VALID [2022-02-20 14:34:34,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {4449#false} assume !(3 == mp_add_~i~0#1 % 256); {4449#false} is VALID [2022-02-20 14:34:34,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {4449#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {4449#false} is VALID [2022-02-20 14:34:34,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {4449#false} assume !(mp_add_~i~0#1 % 256 < 4); {4449#false} is VALID [2022-02-20 14:34:34,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {4449#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {4449#false} is VALID [2022-02-20 14:34:34,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {4449#false} mp_add_#res#1 := mp_add_~r~0#1; {4449#false} is VALID [2022-02-20 14:34:34,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {4449#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4449#false} is VALID [2022-02-20 14:34:34,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {4449#false} assume 0 == __VERIFIER_assert_~cond#1; {4449#false} is VALID [2022-02-20 14:34:34,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {4449#false} assume !false; {4449#false} is VALID [2022-02-20 14:34:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:34:34,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:34,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280398522] [2022-02-20 14:34:34,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280398522] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:34:34,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000277687] [2022-02-20 14:34:34,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:34,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:34:34,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:34:34,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:34:34,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:34:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:34,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:34:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:34,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:34:35,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {4448#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {4448#true} is VALID [2022-02-20 14:34:35,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {4448#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {4448#true} is VALID [2022-02-20 14:34:35,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {4448#true} assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {4448#true} is VALID [2022-02-20 14:34:35,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {4448#true} assume !(0 == mp_add_~a2~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {4448#true} mp_add_~nb~0#1 := 4; {4448#true} is VALID [2022-02-20 14:34:35,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {4448#true} assume !(0 == mp_add_~b3~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {4448#true} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {4448#true} is VALID [2022-02-20 14:34:35,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {4448#true} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {4448#true} is VALID [2022-02-20 14:34:35,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {4448#true} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {4448#true} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {4448#true} is VALID [2022-02-20 14:34:35,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {4448#true} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; {4448#true} is VALID [2022-02-20 14:34:35,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {4448#true} assume !(1 == mp_add_~i~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {4448#true} assume !(2 == mp_add_~i~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {4448#true} assume !(3 == mp_add_~i~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {4448#true} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {4448#true} is VALID [2022-02-20 14:34:35,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {4448#true} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {4448#true} is VALID [2022-02-20 14:34:35,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {4448#true} assume !(1 == mp_add_~i~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {4448#true} assume !(2 == mp_add_~i~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {4448#true} assume !(3 == mp_add_~i~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {4448#true} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {4448#true} is VALID [2022-02-20 14:34:35,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {4448#true} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {4448#true} is VALID [2022-02-20 14:34:35,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {4448#true} assume !!(mp_add_~i~0#1 % 256 < 4); {4448#true} is VALID [2022-02-20 14:34:35,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {4448#true} assume !(0 == mp_add_~i~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {4448#true} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; {4448#true} is VALID [2022-02-20 14:34:35,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {4448#true} assume !(2 == mp_add_~i~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {4448#true} assume !(3 == mp_add_~i~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {4448#true} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {4448#true} is VALID [2022-02-20 14:34:35,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {4448#true} assume !!(mp_add_~i~0#1 % 256 < 4); {4448#true} is VALID [2022-02-20 14:34:35,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {4448#true} assume !(0 == mp_add_~i~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {4448#true} assume !(1 == mp_add_~i~0#1 % 256); {4448#true} is VALID [2022-02-20 14:34:35,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {4448#true} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := 0; {4547#(= 2 (mod |ULTIMATE.start_mp_add_~i~0#1| 256))} is VALID [2022-02-20 14:34:35,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {4547#(= 2 (mod |ULTIMATE.start_mp_add_~i~0#1| 256))} assume !(3 == mp_add_~i~0#1 % 256); {4547#(= 2 (mod |ULTIMATE.start_mp_add_~i~0#1| 256))} is VALID [2022-02-20 14:34:35,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {4547#(= 2 (mod |ULTIMATE.start_mp_add_~i~0#1| 256))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {4554#(= |ULTIMATE.start_mp_add_~i~0#1| 3)} is VALID [2022-02-20 14:34:35,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {4554#(= |ULTIMATE.start_mp_add_~i~0#1| 3)} assume !(mp_add_~i~0#1 % 256 < 4); {4449#false} is VALID [2022-02-20 14:34:35,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {4449#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {4449#false} is VALID [2022-02-20 14:34:35,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {4449#false} mp_add_#res#1 := mp_add_~r~0#1; {4449#false} is VALID [2022-02-20 14:34:35,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {4449#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4449#false} is VALID [2022-02-20 14:34:35,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {4449#false} assume 0 == __VERIFIER_assert_~cond#1; {4449#false} is VALID [2022-02-20 14:34:35,046 INFO L290 TraceCheckUtils]: 38: Hoare triple {4449#false} assume !false; {4449#false} is VALID [2022-02-20 14:34:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:34:35,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:34:35,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000277687] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:35,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:34:35,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-02-20 14:34:35,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916427209] [2022-02-20 14:34:35,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:35,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 14:34:35,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:35,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:35,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:35,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:34:35,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:35,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:34:35,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:34:35,076 INFO L87 Difference]: Start difference. First operand 149 states and 218 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:35,477 INFO L93 Difference]: Finished difference Result 338 states and 516 transitions. [2022-02-20 14:34:35,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:34:35,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 14:34:35,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-02-20 14:34:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-02-20 14:34:35,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2022-02-20 14:34:35,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:35,680 INFO L225 Difference]: With dead ends: 338 [2022-02-20 14:34:35,680 INFO L226 Difference]: Without dead ends: 209 [2022-02-20 14:34:35,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:34:35,681 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 48 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:35,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 159 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:34:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-02-20 14:34:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 190. [2022-02-20 14:34:35,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:35,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 190 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 189 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:35,733 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 190 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 189 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:35,734 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 190 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 189 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:35,737 INFO L93 Difference]: Finished difference Result 209 states and 289 transitions. [2022-02-20 14:34:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 289 transitions. [2022-02-20 14:34:35,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:35,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:35,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 189 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 209 states. [2022-02-20 14:34:35,738 INFO L87 Difference]: Start difference. First operand has 190 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 189 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 209 states. [2022-02-20 14:34:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:35,741 INFO L93 Difference]: Finished difference Result 209 states and 289 transitions. [2022-02-20 14:34:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 289 transitions. [2022-02-20 14:34:35,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:35,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:35,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:35,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:35,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 189 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 267 transitions. [2022-02-20 14:34:35,745 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 267 transitions. Word has length 39 [2022-02-20 14:34:35,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:35,745 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 267 transitions. [2022-02-20 14:34:35,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 267 transitions. [2022-02-20 14:34:35,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 14:34:35,746 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:35,747 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:35,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:34:35,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:34:35,967 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:35,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:35,968 INFO L85 PathProgramCache]: Analyzing trace with hash 790077655, now seen corresponding path program 1 times [2022-02-20 14:34:35,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:35,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019323603] [2022-02-20 14:34:35,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:35,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:36,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {5536#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {5536#true} is VALID [2022-02-20 14:34:36,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {5536#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {5536#true} is VALID [2022-02-20 14:34:36,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {5536#true} assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {5536#true} is VALID [2022-02-20 14:34:36,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {5536#true} assume !(0 == mp_add_~a2~0#1 % 256); {5536#true} is VALID [2022-02-20 14:34:36,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {5536#true} mp_add_~nb~0#1 := 4; {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(0 == mp_add_~b3~0#1 % 256); {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(1 == mp_add_~i~0#1 % 256); {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(2 == mp_add_~i~0#1 % 256); {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(3 == mp_add_~i~0#1 % 256); {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(1 == mp_add_~i~0#1 % 256); {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(2 == mp_add_~i~0#1 % 256); {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(3 == mp_add_~i~0#1 % 256); {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {5539#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) (div |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {5540#(<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~nb~0#1|)} is VALID [2022-02-20 14:34:36,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {5540#(<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~nb~0#1|)} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {5541#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} is VALID [2022-02-20 14:34:36,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {5541#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} assume !!(mp_add_~i~0#1 % 256 < 4); {5541#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} is VALID [2022-02-20 14:34:36,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {5541#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} assume !(0 == mp_add_~i~0#1 % 256); {5541#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} is VALID [2022-02-20 14:34:36,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {5541#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; {5537#false} is VALID [2022-02-20 14:34:36,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {5537#false} assume !(2 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {5537#false} assume !(3 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {5537#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {5537#false} is VALID [2022-02-20 14:34:36,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {5537#false} assume !!(mp_add_~i~0#1 % 256 < 4); {5537#false} is VALID [2022-02-20 14:34:36,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {5537#false} assume !(0 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {5537#false} assume !(1 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {5537#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := 0; {5537#false} is VALID [2022-02-20 14:34:36,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {5537#false} assume !(3 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {5537#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {5537#false} is VALID [2022-02-20 14:34:36,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {5537#false} assume !!(mp_add_~i~0#1 % 256 < 4); {5537#false} is VALID [2022-02-20 14:34:36,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {5537#false} assume !(0 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {5537#false} assume !(1 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {5537#false} assume !(2 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {5537#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := 0; {5537#false} is VALID [2022-02-20 14:34:36,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {5537#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {5537#false} is VALID [2022-02-20 14:34:36,147 INFO L290 TraceCheckUtils]: 39: Hoare triple {5537#false} assume !(mp_add_~i~0#1 % 256 < 4); {5537#false} is VALID [2022-02-20 14:34:36,148 INFO L290 TraceCheckUtils]: 40: Hoare triple {5537#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {5537#false} is VALID [2022-02-20 14:34:36,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {5537#false} mp_add_#res#1 := mp_add_~r~0#1; {5537#false} is VALID [2022-02-20 14:34:36,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {5537#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5537#false} is VALID [2022-02-20 14:34:36,148 INFO L290 TraceCheckUtils]: 43: Hoare triple {5537#false} assume 0 == __VERIFIER_assert_~cond#1; {5537#false} is VALID [2022-02-20 14:34:36,148 INFO L290 TraceCheckUtils]: 44: Hoare triple {5537#false} assume !false; {5537#false} is VALID [2022-02-20 14:34:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 14:34:36,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:36,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019323603] [2022-02-20 14:34:36,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019323603] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:34:36,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720343644] [2022-02-20 14:34:36,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:36,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:34:36,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:34:36,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:34:36,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 14:34:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:36,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:34:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:36,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:34:36,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {5536#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {5536#true} is VALID [2022-02-20 14:34:36,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {5536#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {5536#true} is VALID [2022-02-20 14:34:36,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {5536#true} assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {5536#true} is VALID [2022-02-20 14:34:36,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {5536#true} assume !(0 == mp_add_~a2~0#1 % 256); {5536#true} is VALID [2022-02-20 14:34:36,911 INFO L290 TraceCheckUtils]: 4: Hoare triple {5536#true} mp_add_~nb~0#1 := 4; {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(0 == mp_add_~b3~0#1 % 256); {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {5572#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4) (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)))} is VALID [2022-02-20 14:34:36,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {5572#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4) (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(1 == mp_add_~i~0#1 % 256); {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(2 == mp_add_~i~0#1 % 256); {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(3 == mp_add_~i~0#1 % 256); {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(1 == mp_add_~i~0#1 % 256); {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(2 == mp_add_~i~0#1 % 256); {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(3 == mp_add_~i~0#1 % 256); {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:36,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {5538#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {5541#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} is VALID [2022-02-20 14:34:36,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {5541#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} assume !!(mp_add_~i~0#1 % 256 < 4); {5541#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} is VALID [2022-02-20 14:34:36,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {5541#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} assume !(0 == mp_add_~i~0#1 % 256); {5541#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} is VALID [2022-02-20 14:34:36,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {5541#(<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) |ULTIMATE.start_mp_add_~i~0#1|)} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; {5537#false} is VALID [2022-02-20 14:34:36,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {5537#false} assume !(2 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {5537#false} assume !(3 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {5537#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {5537#false} is VALID [2022-02-20 14:34:36,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {5537#false} assume !!(mp_add_~i~0#1 % 256 < 4); {5537#false} is VALID [2022-02-20 14:34:36,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {5537#false} assume !(0 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {5537#false} assume !(1 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {5537#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := 0; {5537#false} is VALID [2022-02-20 14:34:36,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {5537#false} assume !(3 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {5537#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {5537#false} is VALID [2022-02-20 14:34:36,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {5537#false} assume !!(mp_add_~i~0#1 % 256 < 4); {5537#false} is VALID [2022-02-20 14:34:36,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {5537#false} assume !(0 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {5537#false} assume !(1 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {5537#false} assume !(2 == mp_add_~i~0#1 % 256); {5537#false} is VALID [2022-02-20 14:34:36,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {5537#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := 0; {5537#false} is VALID [2022-02-20 14:34:36,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {5537#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {5537#false} is VALID [2022-02-20 14:34:36,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {5537#false} assume !(mp_add_~i~0#1 % 256 < 4); {5537#false} is VALID [2022-02-20 14:34:36,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {5537#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {5537#false} is VALID [2022-02-20 14:34:36,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {5537#false} mp_add_#res#1 := mp_add_~r~0#1; {5537#false} is VALID [2022-02-20 14:34:36,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {5537#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5537#false} is VALID [2022-02-20 14:34:36,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {5537#false} assume 0 == __VERIFIER_assert_~cond#1; {5537#false} is VALID [2022-02-20 14:34:36,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {5537#false} assume !false; {5537#false} is VALID [2022-02-20 14:34:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 14:34:36,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:34:36,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720343644] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:36,922 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:34:36,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 14:34:36,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179931221] [2022-02-20 14:34:36,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:36,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-20 14:34:36,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:36,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:36,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:36,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:34:36,948 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:36,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:34:36,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:34:36,949 INFO L87 Difference]: Start difference. First operand 190 states and 267 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:37,236 INFO L93 Difference]: Finished difference Result 395 states and 559 transitions. [2022-02-20 14:34:37,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:34:37,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-20 14:34:37,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2022-02-20 14:34:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:37,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2022-02-20 14:34:37,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 152 transitions. [2022-02-20 14:34:37,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:37,365 INFO L225 Difference]: With dead ends: 395 [2022-02-20 14:34:37,365 INFO L226 Difference]: Without dead ends: 205 [2022-02-20 14:34:37,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:34:37,366 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 110 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:37,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 88 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:34:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-02-20 14:34:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 180. [2022-02-20 14:34:37,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:37,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 180 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 179 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:37,392 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 180 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 179 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:37,392 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 180 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 179 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:37,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:37,396 INFO L93 Difference]: Finished difference Result 205 states and 269 transitions. [2022-02-20 14:34:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 269 transitions. [2022-02-20 14:34:37,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:37,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:37,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 179 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 205 states. [2022-02-20 14:34:37,398 INFO L87 Difference]: Start difference. First operand has 180 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 179 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 205 states. [2022-02-20 14:34:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:37,401 INFO L93 Difference]: Finished difference Result 205 states and 269 transitions. [2022-02-20 14:34:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 269 transitions. [2022-02-20 14:34:37,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:37,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:37,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:37,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:37,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 179 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 242 transitions. [2022-02-20 14:34:37,406 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 242 transitions. Word has length 45 [2022-02-20 14:34:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:37,406 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 242 transitions. [2022-02-20 14:34:37,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 242 transitions. [2022-02-20 14:34:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 14:34:37,407 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:37,407 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:37,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:34:37,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-20 14:34:37,623 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:37,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:37,624 INFO L85 PathProgramCache]: Analyzing trace with hash -975887029, now seen corresponding path program 1 times [2022-02-20 14:34:37,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:37,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191262760] [2022-02-20 14:34:37,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:37,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:37,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {6683#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {6683#true} is VALID [2022-02-20 14:34:37,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {6683#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {6685#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} is VALID [2022-02-20 14:34:37,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {6685#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {6686#(<= 3 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|)) 256))))} is VALID [2022-02-20 14:34:37,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {6686#(<= 3 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|)) 256))))} assume !(0 == mp_add_~a2~0#1 % 256); {6686#(<= 3 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|)) 256))))} is VALID [2022-02-20 14:34:37,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {6686#(<= 3 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|)) 256))))} mp_add_~nb~0#1 := 4; {6686#(<= 3 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|)) 256))))} is VALID [2022-02-20 14:34:37,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {6686#(<= 3 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|)) 256))))} assume !(0 == mp_add_~b3~0#1 % 256); {6686#(<= 3 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|)) 256))))} is VALID [2022-02-20 14:34:37,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {6686#(<= 3 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|)) 256))))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {6687#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256))) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~na~0#1|)))} is VALID [2022-02-20 14:34:37,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {6687#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256))) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~na~0#1|)))} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {6687#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256))) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~na~0#1|)))} is VALID [2022-02-20 14:34:37,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {6687#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256))) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~na~0#1|)))} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {6684#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {6684#false} is VALID [2022-02-20 14:34:37,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {6684#false} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; {6684#false} is VALID [2022-02-20 14:34:37,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {6684#false} assume !(1 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {6684#false} assume !(2 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {6684#false} assume !(3 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {6684#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {6684#false} is VALID [2022-02-20 14:34:37,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {6684#false} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {6684#false} is VALID [2022-02-20 14:34:37,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {6684#false} assume !(1 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {6684#false} assume !(2 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {6684#false} assume !(3 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {6684#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {6684#false} is VALID [2022-02-20 14:34:37,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {6684#false} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {6684#false} is VALID [2022-02-20 14:34:37,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {6684#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {6684#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {6684#false} is VALID [2022-02-20 14:34:37,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {6684#false} assume !(0 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {6684#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; {6684#false} is VALID [2022-02-20 14:34:37,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {6684#false} assume !(2 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {6684#false} assume !(3 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {6684#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {6684#false} is VALID [2022-02-20 14:34:37,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {6684#false} assume !(0 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {6684#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {6684#false} is VALID [2022-02-20 14:34:37,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {6684#false} assume !(2 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {6684#false} assume !(3 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {6684#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {6684#false} is VALID [2022-02-20 14:34:37,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {6684#false} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {6684#false} is VALID [2022-02-20 14:34:37,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {6684#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {6684#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {6684#false} is VALID [2022-02-20 14:34:37,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {6684#false} assume !(0 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,754 INFO L290 TraceCheckUtils]: 37: Hoare triple {6684#false} assume !(1 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {6684#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; {6684#false} is VALID [2022-02-20 14:34:37,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {6684#false} assume !(3 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,755 INFO L290 TraceCheckUtils]: 40: Hoare triple {6684#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {6684#false} is VALID [2022-02-20 14:34:37,755 INFO L290 TraceCheckUtils]: 41: Hoare triple {6684#false} assume !(0 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {6684#false} assume !(1 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,755 INFO L290 TraceCheckUtils]: 43: Hoare triple {6684#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {6684#false} is VALID [2022-02-20 14:34:37,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {6684#false} assume !(3 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {6684#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {6684#false} is VALID [2022-02-20 14:34:37,755 INFO L290 TraceCheckUtils]: 46: Hoare triple {6684#false} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {6684#false} is VALID [2022-02-20 14:34:37,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {6684#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,756 INFO L290 TraceCheckUtils]: 48: Hoare triple {6684#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {6684#false} is VALID [2022-02-20 14:34:37,756 INFO L290 TraceCheckUtils]: 49: Hoare triple {6684#false} assume !(0 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,756 INFO L290 TraceCheckUtils]: 50: Hoare triple {6684#false} assume !(1 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,756 INFO L290 TraceCheckUtils]: 51: Hoare triple {6684#false} assume !(2 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {6684#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; {6684#false} is VALID [2022-02-20 14:34:37,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {6684#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {6684#false} is VALID [2022-02-20 14:34:37,756 INFO L290 TraceCheckUtils]: 54: Hoare triple {6684#false} assume !(0 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {6684#false} assume !(1 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {6684#false} assume !(2 == mp_add_~i~0#1 % 256); {6684#false} is VALID [2022-02-20 14:34:37,757 INFO L290 TraceCheckUtils]: 57: Hoare triple {6684#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; {6684#false} is VALID [2022-02-20 14:34:37,757 INFO L290 TraceCheckUtils]: 58: Hoare triple {6684#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {6684#false} is VALID [2022-02-20 14:34:37,757 INFO L290 TraceCheckUtils]: 59: Hoare triple {6684#false} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {6684#false} is VALID [2022-02-20 14:34:37,757 INFO L290 TraceCheckUtils]: 60: Hoare triple {6684#false} assume !(mp_add_~i~0#1 % 256 < 4); {6684#false} is VALID [2022-02-20 14:34:37,757 INFO L290 TraceCheckUtils]: 61: Hoare triple {6684#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {6684#false} is VALID [2022-02-20 14:34:37,757 INFO L290 TraceCheckUtils]: 62: Hoare triple {6684#false} mp_add_#res#1 := mp_add_~r~0#1; {6684#false} is VALID [2022-02-20 14:34:37,758 INFO L290 TraceCheckUtils]: 63: Hoare triple {6684#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6684#false} is VALID [2022-02-20 14:34:37,758 INFO L290 TraceCheckUtils]: 64: Hoare triple {6684#false} assume 0 == __VERIFIER_assert_~cond#1; {6684#false} is VALID [2022-02-20 14:34:37,758 INFO L290 TraceCheckUtils]: 65: Hoare triple {6684#false} assume !false; {6684#false} is VALID [2022-02-20 14:34:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-02-20 14:34:37,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:37,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191262760] [2022-02-20 14:34:37,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191262760] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:37,758 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:37,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:34:37,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066857143] [2022-02-20 14:34:37,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:37,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 14:34:37,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:37,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:37,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:37,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:34:37,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:37,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:34:37,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:34:37,790 INFO L87 Difference]: Start difference. First operand 180 states and 242 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:38,528 INFO L93 Difference]: Finished difference Result 717 states and 958 transitions. [2022-02-20 14:34:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:34:38,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 14:34:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:38,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 274 transitions. [2022-02-20 14:34:38,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:38,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 274 transitions. [2022-02-20 14:34:38,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 274 transitions. [2022-02-20 14:34:38,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:38,746 INFO L225 Difference]: With dead ends: 717 [2022-02-20 14:34:38,746 INFO L226 Difference]: Without dead ends: 553 [2022-02-20 14:34:38,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:34:38,748 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 199 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:38,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 362 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:34:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-02-20 14:34:38,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 180. [2022-02-20 14:34:38,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:38,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 553 states. Second operand has 180 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 179 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:38,786 INFO L74 IsIncluded]: Start isIncluded. First operand 553 states. Second operand has 180 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 179 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:38,786 INFO L87 Difference]: Start difference. First operand 553 states. Second operand has 180 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 179 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:38,797 INFO L93 Difference]: Finished difference Result 553 states and 735 transitions. [2022-02-20 14:34:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 735 transitions. [2022-02-20 14:34:38,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:38,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:38,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 179 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 553 states. [2022-02-20 14:34:38,799 INFO L87 Difference]: Start difference. First operand has 180 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 179 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 553 states. [2022-02-20 14:34:38,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:38,810 INFO L93 Difference]: Finished difference Result 553 states and 735 transitions. [2022-02-20 14:34:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 735 transitions. [2022-02-20 14:34:38,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:38,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:38,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:38,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 179 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 242 transitions. [2022-02-20 14:34:38,813 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 242 transitions. Word has length 66 [2022-02-20 14:34:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:38,814 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 242 transitions. [2022-02-20 14:34:38,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 242 transitions. [2022-02-20 14:34:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 14:34:38,814 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:38,815 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:38,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 14:34:38,815 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:38,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:38,815 INFO L85 PathProgramCache]: Analyzing trace with hash -42691454, now seen corresponding path program 1 times [2022-02-20 14:34:38,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:38,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662501489] [2022-02-20 14:34:38,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:38,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:38,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {8727#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {8727#true} is VALID [2022-02-20 14:34:38,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {8727#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {8729#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} is VALID [2022-02-20 14:34:38,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {8729#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {8730#(<= 3 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|)) 256))))} is VALID [2022-02-20 14:34:38,959 INFO L290 TraceCheckUtils]: 3: Hoare triple {8730#(<= 3 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|)) 256))))} assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {8731#(<= 2 (+ |ULTIMATE.start_mp_add_~na~0#1| (* (div (+ 2 (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|)) 256) 256)))} is VALID [2022-02-20 14:34:38,960 INFO L290 TraceCheckUtils]: 4: Hoare triple {8731#(<= 2 (+ |ULTIMATE.start_mp_add_~na~0#1| (* (div (+ 2 (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|)) 256) 256)))} assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {8732#(<= 1 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|) 1) 256))))} is VALID [2022-02-20 14:34:38,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {8732#(<= 1 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|) 1) 256))))} mp_add_~nb~0#1 := 4; {8732#(<= 1 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|) 1) 256))))} is VALID [2022-02-20 14:34:38,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {8732#(<= 1 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|) 1) 256))))} assume !(0 == mp_add_~b3~0#1 % 256); {8732#(<= 1 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|) 1) 256))))} is VALID [2022-02-20 14:34:38,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {8732#(<= 1 (+ |ULTIMATE.start_mp_add_~na~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~na~0#1|) 1) 256))))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {8733#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256)) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~na~0#1|)))} is VALID [2022-02-20 14:34:38,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {8733#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256)) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~na~0#1|)))} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {8733#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256)) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~na~0#1|)))} is VALID [2022-02-20 14:34:38,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {8733#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256)) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~na~0#1|)))} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {8728#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {8728#false} is VALID [2022-02-20 14:34:38,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {8728#false} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; {8728#false} is VALID [2022-02-20 14:34:38,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {8728#false} assume !(1 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {8728#false} assume !(2 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {8728#false} assume !(3 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {8728#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {8728#false} is VALID [2022-02-20 14:34:38,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {8728#false} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {8728#false} is VALID [2022-02-20 14:34:38,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {8728#false} assume !(1 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {8728#false} assume !(2 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {8728#false} assume !(3 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {8728#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {8728#false} is VALID [2022-02-20 14:34:38,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {8728#false} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {8728#false} is VALID [2022-02-20 14:34:38,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {8728#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {8728#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {8728#false} is VALID [2022-02-20 14:34:38,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {8728#false} assume !(0 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {8728#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; {8728#false} is VALID [2022-02-20 14:34:38,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {8728#false} assume !(2 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {8728#false} assume !(3 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {8728#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {8728#false} is VALID [2022-02-20 14:34:38,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {8728#false} assume !(0 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {8728#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {8728#false} is VALID [2022-02-20 14:34:38,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {8728#false} assume !(2 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {8728#false} assume !(3 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {8728#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {8728#false} is VALID [2022-02-20 14:34:38,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {8728#false} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {8728#false} is VALID [2022-02-20 14:34:38,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {8728#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {8728#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {8728#false} is VALID [2022-02-20 14:34:38,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {8728#false} assume !(0 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {8728#false} assume !(1 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {8728#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; {8728#false} is VALID [2022-02-20 14:34:38,967 INFO L290 TraceCheckUtils]: 40: Hoare triple {8728#false} assume !(3 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,968 INFO L290 TraceCheckUtils]: 41: Hoare triple {8728#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {8728#false} is VALID [2022-02-20 14:34:38,968 INFO L290 TraceCheckUtils]: 42: Hoare triple {8728#false} assume !(0 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,968 INFO L290 TraceCheckUtils]: 43: Hoare triple {8728#false} assume !(1 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,968 INFO L290 TraceCheckUtils]: 44: Hoare triple {8728#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {8728#false} is VALID [2022-02-20 14:34:38,968 INFO L290 TraceCheckUtils]: 45: Hoare triple {8728#false} assume !(3 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,968 INFO L290 TraceCheckUtils]: 46: Hoare triple {8728#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {8728#false} is VALID [2022-02-20 14:34:38,968 INFO L290 TraceCheckUtils]: 47: Hoare triple {8728#false} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {8728#false} is VALID [2022-02-20 14:34:38,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {8728#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,969 INFO L290 TraceCheckUtils]: 49: Hoare triple {8728#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {8728#false} is VALID [2022-02-20 14:34:38,969 INFO L290 TraceCheckUtils]: 50: Hoare triple {8728#false} assume !(0 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,969 INFO L290 TraceCheckUtils]: 51: Hoare triple {8728#false} assume !(1 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,969 INFO L290 TraceCheckUtils]: 52: Hoare triple {8728#false} assume !(2 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,969 INFO L290 TraceCheckUtils]: 53: Hoare triple {8728#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; {8728#false} is VALID [2022-02-20 14:34:38,969 INFO L290 TraceCheckUtils]: 54: Hoare triple {8728#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {8728#false} is VALID [2022-02-20 14:34:38,969 INFO L290 TraceCheckUtils]: 55: Hoare triple {8728#false} assume !(0 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,969 INFO L290 TraceCheckUtils]: 56: Hoare triple {8728#false} assume !(1 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,970 INFO L290 TraceCheckUtils]: 57: Hoare triple {8728#false} assume !(2 == mp_add_~i~0#1 % 256); {8728#false} is VALID [2022-02-20 14:34:38,970 INFO L290 TraceCheckUtils]: 58: Hoare triple {8728#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; {8728#false} is VALID [2022-02-20 14:34:38,970 INFO L290 TraceCheckUtils]: 59: Hoare triple {8728#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {8728#false} is VALID [2022-02-20 14:34:38,970 INFO L290 TraceCheckUtils]: 60: Hoare triple {8728#false} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {8728#false} is VALID [2022-02-20 14:34:38,970 INFO L290 TraceCheckUtils]: 61: Hoare triple {8728#false} assume !(mp_add_~i~0#1 % 256 < 4); {8728#false} is VALID [2022-02-20 14:34:38,970 INFO L290 TraceCheckUtils]: 62: Hoare triple {8728#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {8728#false} is VALID [2022-02-20 14:34:38,970 INFO L290 TraceCheckUtils]: 63: Hoare triple {8728#false} mp_add_#res#1 := mp_add_~r~0#1; {8728#false} is VALID [2022-02-20 14:34:38,970 INFO L290 TraceCheckUtils]: 64: Hoare triple {8728#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {8728#false} is VALID [2022-02-20 14:34:38,971 INFO L290 TraceCheckUtils]: 65: Hoare triple {8728#false} assume 0 == __VERIFIER_assert_~cond#1; {8728#false} is VALID [2022-02-20 14:34:38,971 INFO L290 TraceCheckUtils]: 66: Hoare triple {8728#false} assume !false; {8728#false} is VALID [2022-02-20 14:34:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-02-20 14:34:38,971 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:38,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662501489] [2022-02-20 14:34:38,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662501489] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:38,971 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:38,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 14:34:38,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016563144] [2022-02-20 14:34:38,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:38,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 14:34:38,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:38,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:38,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:38,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:34:38,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:38,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:34:38,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:34:38,998 INFO L87 Difference]: Start difference. First operand 180 states and 242 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:40,631 INFO L93 Difference]: Finished difference Result 925 states and 1228 transitions. [2022-02-20 14:34:40,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 14:34:40,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 14:34:40,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 378 transitions. [2022-02-20 14:34:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 378 transitions. [2022-02-20 14:34:40,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 378 transitions. [2022-02-20 14:34:40,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 378 edges. 378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:40,937 INFO L225 Difference]: With dead ends: 925 [2022-02-20 14:34:40,937 INFO L226 Difference]: Without dead ends: 761 [2022-02-20 14:34:40,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:34:40,938 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 401 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:40,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 702 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 14:34:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-02-20 14:34:40,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 175. [2022-02-20 14:34:40,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:40,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 761 states. Second operand has 175 states, 174 states have (on average 1.3563218390804597) internal successors, (236), 174 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:40,976 INFO L74 IsIncluded]: Start isIncluded. First operand 761 states. Second operand has 175 states, 174 states have (on average 1.3563218390804597) internal successors, (236), 174 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:40,976 INFO L87 Difference]: Start difference. First operand 761 states. Second operand has 175 states, 174 states have (on average 1.3563218390804597) internal successors, (236), 174 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:40,998 INFO L93 Difference]: Finished difference Result 761 states and 1004 transitions. [2022-02-20 14:34:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1004 transitions. [2022-02-20 14:34:40,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:40,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:41,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 174 states have (on average 1.3563218390804597) internal successors, (236), 174 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 761 states. [2022-02-20 14:34:41,000 INFO L87 Difference]: Start difference. First operand has 175 states, 174 states have (on average 1.3563218390804597) internal successors, (236), 174 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 761 states. [2022-02-20 14:34:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:41,019 INFO L93 Difference]: Finished difference Result 761 states and 1004 transitions. [2022-02-20 14:34:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1004 transitions. [2022-02-20 14:34:41,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:41,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:41,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:41,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.3563218390804597) internal successors, (236), 174 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 236 transitions. [2022-02-20 14:34:41,022 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 236 transitions. Word has length 67 [2022-02-20 14:34:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:41,022 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 236 transitions. [2022-02-20 14:34:41,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 236 transitions. [2022-02-20 14:34:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 14:34:41,023 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:41,023 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:41,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 14:34:41,024 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2082079527, now seen corresponding path program 1 times [2022-02-20 14:34:41,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:41,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500065263] [2022-02-20 14:34:41,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:41,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {11401#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {11401#true} is VALID [2022-02-20 14:34:41,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {11401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(0 == mp_add_~a3~0#1 % 256); {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} mp_add_~nb~0#1 := 4; {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(0 == mp_add_~b3~0#1 % 256); {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {11404#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~na~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0)))} is VALID [2022-02-20 14:34:41,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {11404#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~na~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0)))} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(1 == mp_add_~i~0#1 % 256); {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(2 == mp_add_~i~0#1 % 256); {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(3 == mp_add_~i~0#1 % 256); {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(1 == mp_add_~i~0#1 % 256); {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(2 == mp_add_~i~0#1 % 256); {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(3 == mp_add_~i~0#1 % 256); {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(1 == mp_add_~i~0#1 % 256); {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(2 == mp_add_~i~0#1 % 256); {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(3 == mp_add_~i~0#1 % 256); {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {11403#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {11405#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) (+ |ULTIMATE.start_mp_add_~i~0#1| (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256)))) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {11405#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) (+ |ULTIMATE.start_mp_add_~i~0#1| (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256)))) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {11405#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) (+ |ULTIMATE.start_mp_add_~i~0#1| (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256)))) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {11405#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) (+ |ULTIMATE.start_mp_add_~i~0#1| (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256)))) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(0 == mp_add_~i~0#1 % 256); {11405#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) (+ |ULTIMATE.start_mp_add_~i~0#1| (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256)))) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:41,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {11405#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 4) (+ |ULTIMATE.start_mp_add_~i~0#1| (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256)))) (<= (div |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {11402#false} assume !(2 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {11402#false} assume !(3 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {11402#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {11402#false} is VALID [2022-02-20 14:34:41,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {11402#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {11402#false} is VALID [2022-02-20 14:34:41,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {11402#false} assume !(2 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {11402#false} assume !(3 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {11402#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {11402#false} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {11402#false} is VALID [2022-02-20 14:34:41,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {11402#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {11402#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {11402#false} assume !(1 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {11402#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {11402#false} assume !(3 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {11402#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {11402#false} is VALID [2022-02-20 14:34:41,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {11402#false} assume !(1 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,193 INFO L290 TraceCheckUtils]: 46: Hoare triple {11402#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {11402#false} is VALID [2022-02-20 14:34:41,193 INFO L290 TraceCheckUtils]: 47: Hoare triple {11402#false} assume !(3 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,193 INFO L290 TraceCheckUtils]: 48: Hoare triple {11402#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {11402#false} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {11402#false} is VALID [2022-02-20 14:34:41,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {11402#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,194 INFO L290 TraceCheckUtils]: 51: Hoare triple {11402#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,194 INFO L290 TraceCheckUtils]: 53: Hoare triple {11402#false} assume !(1 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {11402#false} assume !(2 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,194 INFO L290 TraceCheckUtils]: 55: Hoare triple {11402#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,194 INFO L290 TraceCheckUtils]: 56: Hoare triple {11402#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {11402#false} is VALID [2022-02-20 14:34:41,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {11402#false} assume !(1 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {11402#false} assume !(2 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {11402#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; {11402#false} is VALID [2022-02-20 14:34:41,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {11402#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {11402#false} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {11402#false} is VALID [2022-02-20 14:34:41,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {11402#false} assume !(mp_add_~i~0#1 % 256 < 4); {11402#false} is VALID [2022-02-20 14:34:41,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {11402#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {11402#false} is VALID [2022-02-20 14:34:41,196 INFO L290 TraceCheckUtils]: 65: Hoare triple {11402#false} mp_add_#res#1 := mp_add_~r~0#1; {11402#false} is VALID [2022-02-20 14:34:41,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {11402#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {11402#false} is VALID [2022-02-20 14:34:41,196 INFO L290 TraceCheckUtils]: 67: Hoare triple {11402#false} assume 0 == __VERIFIER_assert_~cond#1; {11402#false} is VALID [2022-02-20 14:34:41,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {11402#false} assume !false; {11402#false} is VALID [2022-02-20 14:34:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-20 14:34:41,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:41,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500065263] [2022-02-20 14:34:41,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500065263] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:34:41,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187503835] [2022-02-20 14:34:41,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:41,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:34:41,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:34:41,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:34:41,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 14:34:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:41,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:34:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:41,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:34:41,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {11401#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {11401#true} is VALID [2022-02-20 14:34:41,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {11401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !(0 == mp_add_~a3~0#1 % 256); {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} mp_add_~nb~0#1 := 4; {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !(0 == mp_add_~b3~0#1 % 256); {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !(1 == mp_add_~i~0#1 % 256); {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !(2 == mp_add_~i~0#1 % 256); {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !(3 == mp_add_~i~0#1 % 256); {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !(1 == mp_add_~i~0#1 % 256); {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !(2 == mp_add_~i~0#1 % 256); {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !(3 == mp_add_~i~0#1 % 256); {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !(1 == mp_add_~i~0#1 % 256); {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !(2 == mp_add_~i~0#1 % 256); {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !(3 == mp_add_~i~0#1 % 256); {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} is VALID [2022-02-20 14:34:41,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {11412#(= |ULTIMATE.start_mp_add_~na~0#1| 4)} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {11482#(not (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 4))} is VALID [2022-02-20 14:34:41,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {11482#(not (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 4))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {11482#(not (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 4))} is VALID [2022-02-20 14:34:41,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {11482#(not (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 4))} assume !(0 == mp_add_~i~0#1 % 256); {11482#(not (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 4))} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {11482#(not (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 4))} assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {11402#false} assume !(2 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {11402#false} assume !(3 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {11402#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {11402#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {11402#false} assume !(2 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {11402#false} assume !(3 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {11402#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {11402#false} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {11402#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {11402#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {11402#false} assume !(1 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {11402#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {11402#false} assume !(3 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {11402#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {11402#false} assume !(1 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {11402#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {11402#false} is VALID [2022-02-20 14:34:41,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {11402#false} assume !(3 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {11402#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {11402#false} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {11402#false} is VALID [2022-02-20 14:34:41,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {11402#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {11402#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {11402#false} assume !(1 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,633 INFO L290 TraceCheckUtils]: 54: Hoare triple {11402#false} assume !(2 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,635 INFO L290 TraceCheckUtils]: 55: Hoare triple {11402#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,635 INFO L290 TraceCheckUtils]: 56: Hoare triple {11402#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {11402#false} is VALID [2022-02-20 14:34:41,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,636 INFO L290 TraceCheckUtils]: 58: Hoare triple {11402#false} assume !(1 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,636 INFO L290 TraceCheckUtils]: 59: Hoare triple {11402#false} assume !(2 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:41,636 INFO L290 TraceCheckUtils]: 60: Hoare triple {11402#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; {11402#false} is VALID [2022-02-20 14:34:41,636 INFO L290 TraceCheckUtils]: 61: Hoare triple {11402#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:41,636 INFO L290 TraceCheckUtils]: 62: Hoare triple {11402#false} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {11402#false} is VALID [2022-02-20 14:34:41,636 INFO L290 TraceCheckUtils]: 63: Hoare triple {11402#false} assume !(mp_add_~i~0#1 % 256 < 4); {11402#false} is VALID [2022-02-20 14:34:41,636 INFO L290 TraceCheckUtils]: 64: Hoare triple {11402#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {11402#false} is VALID [2022-02-20 14:34:41,636 INFO L290 TraceCheckUtils]: 65: Hoare triple {11402#false} mp_add_#res#1 := mp_add_~r~0#1; {11402#false} is VALID [2022-02-20 14:34:41,636 INFO L290 TraceCheckUtils]: 66: Hoare triple {11402#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {11402#false} is VALID [2022-02-20 14:34:41,637 INFO L290 TraceCheckUtils]: 67: Hoare triple {11402#false} assume 0 == __VERIFIER_assert_~cond#1; {11402#false} is VALID [2022-02-20 14:34:41,637 INFO L290 TraceCheckUtils]: 68: Hoare triple {11402#false} assume !false; {11402#false} is VALID [2022-02-20 14:34:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-02-20 14:34:41,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:34:42,101 INFO L290 TraceCheckUtils]: 68: Hoare triple {11402#false} assume !false; {11402#false} is VALID [2022-02-20 14:34:42,101 INFO L290 TraceCheckUtils]: 67: Hoare triple {11402#false} assume 0 == __VERIFIER_assert_~cond#1; {11402#false} is VALID [2022-02-20 14:34:42,101 INFO L290 TraceCheckUtils]: 66: Hoare triple {11402#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {11402#false} is VALID [2022-02-20 14:34:42,101 INFO L290 TraceCheckUtils]: 65: Hoare triple {11402#false} mp_add_#res#1 := mp_add_~r~0#1; {11402#false} is VALID [2022-02-20 14:34:42,101 INFO L290 TraceCheckUtils]: 64: Hoare triple {11402#false} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {11402#false} is VALID [2022-02-20 14:34:42,101 INFO L290 TraceCheckUtils]: 63: Hoare triple {11402#false} assume !(mp_add_~i~0#1 % 256 < 4); {11402#false} is VALID [2022-02-20 14:34:42,101 INFO L290 TraceCheckUtils]: 62: Hoare triple {11402#false} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 61: Hoare triple {11402#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {11402#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {11402#false} assume !(2 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 58: Hoare triple {11402#false} assume !(1 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 56: Hoare triple {11402#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 55: Hoare triple {11402#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {11402#false} assume !(2 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {11402#false} assume !(1 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {11402#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {11402#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {11402#false} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {11402#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 47: Hoare triple {11402#false} assume !(3 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 46: Hoare triple {11402#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {11402#false} assume !(1 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {11402#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 42: Hoare triple {11402#false} assume !(3 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,102 INFO L290 TraceCheckUtils]: 41: Hoare triple {11402#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:42,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {11402#false} assume !(1 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {11402#false} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:42,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {11402#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {11402#false} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {11402#false} is VALID [2022-02-20 14:34:42,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {11402#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:42,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {11402#false} assume !(3 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {11402#false} assume !(2 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {11402#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {11402#false} is VALID [2022-02-20 14:34:42,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {11402#false} assume !(0 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {11402#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {11402#false} is VALID [2022-02-20 14:34:42,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {11402#false} assume !(3 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {11402#false} assume !(2 == mp_add_~i~0#1 % 256); {11402#false} is VALID [2022-02-20 14:34:42,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {11738#(not (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 1))} assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; {11402#false} is VALID [2022-02-20 14:34:42,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {11738#(not (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 1))} assume !(0 == mp_add_~i~0#1 % 256); {11738#(not (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 1))} is VALID [2022-02-20 14:34:42,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {11738#(not (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 1))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {11738#(not (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 1))} is VALID [2022-02-20 14:34:42,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {11738#(not (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 1))} is VALID [2022-02-20 14:34:42,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume !(3 == mp_add_~i~0#1 % 256); {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume !(2 == mp_add_~i~0#1 % 256); {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume !(1 == mp_add_~i~0#1 % 256); {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume !(3 == mp_add_~i~0#1 % 256); {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume !(2 == mp_add_~i~0#1 % 256); {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume !(1 == mp_add_~i~0#1 % 256); {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume !(3 == mp_add_~i~0#1 % 256); {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume !(2 == mp_add_~i~0#1 % 256); {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume !(1 == mp_add_~i~0#1 % 256); {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {11800#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {11748#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:42,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {11800#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {11800#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:42,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {11800#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {11800#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:42,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {11800#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(0 == mp_add_~b3~0#1 % 256); {11800#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:42,111 INFO L290 TraceCheckUtils]: 3: Hoare triple {11800#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} mp_add_~nb~0#1 := 4; {11800#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:42,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {11800#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} assume !(0 == mp_add_~a3~0#1 % 256); {11800#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:42,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {11401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {11800#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) 0))} is VALID [2022-02-20 14:34:42,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {11401#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {11401#true} is VALID [2022-02-20 14:34:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-02-20 14:34:42,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187503835] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:34:42,113 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:34:42,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2022-02-20 14:34:42,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013218278] [2022-02-20 14:34:42,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:34:42,114 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-02-20 14:34:42,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:42,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:42,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:42,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 14:34:42,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:42,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 14:34:42,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-20 14:34:42,190 INFO L87 Difference]: Start difference. First operand 175 states and 236 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:43,100 INFO L93 Difference]: Finished difference Result 841 states and 1142 transitions. [2022-02-20 14:34:43,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 14:34:43,100 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-02-20 14:34:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 334 transitions. [2022-02-20 14:34:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 334 transitions. [2022-02-20 14:34:43,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 334 transitions. [2022-02-20 14:34:43,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:43,361 INFO L225 Difference]: With dead ends: 841 [2022-02-20 14:34:43,362 INFO L226 Difference]: Without dead ends: 650 [2022-02-20 14:34:43,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:34:43,363 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 342 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:43,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 294 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:34:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-02-20 14:34:43,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 539. [2022-02-20 14:34:43,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:43,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 650 states. Second operand has 539 states, 538 states have (on average 1.3308550185873607) internal successors, (716), 538 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:43,467 INFO L74 IsIncluded]: Start isIncluded. First operand 650 states. Second operand has 539 states, 538 states have (on average 1.3308550185873607) internal successors, (716), 538 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:43,468 INFO L87 Difference]: Start difference. First operand 650 states. Second operand has 539 states, 538 states have (on average 1.3308550185873607) internal successors, (716), 538 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:43,482 INFO L93 Difference]: Finished difference Result 650 states and 853 transitions. [2022-02-20 14:34:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 853 transitions. [2022-02-20 14:34:43,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:43,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:43,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 539 states, 538 states have (on average 1.3308550185873607) internal successors, (716), 538 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 650 states. [2022-02-20 14:34:43,484 INFO L87 Difference]: Start difference. First operand has 539 states, 538 states have (on average 1.3308550185873607) internal successors, (716), 538 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 650 states. [2022-02-20 14:34:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:43,499 INFO L93 Difference]: Finished difference Result 650 states and 853 transitions. [2022-02-20 14:34:43,499 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 853 transitions. [2022-02-20 14:34:43,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:43,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:43,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:43,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.3308550185873607) internal successors, (716), 538 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 716 transitions. [2022-02-20 14:34:43,511 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 716 transitions. Word has length 69 [2022-02-20 14:34:43,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:43,512 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 716 transitions. [2022-02-20 14:34:43,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 716 transitions. [2022-02-20 14:34:43,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 14:34:43,512 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:43,513 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:43,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 14:34:43,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:34:43,730 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:43,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:43,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1036981234, now seen corresponding path program 1 times [2022-02-20 14:34:43,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:43,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636504919] [2022-02-20 14:34:43,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:43,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:43,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {14548#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {14548#true} is VALID [2022-02-20 14:34:43,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {14548#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} mp_add_~nb~0#1 := 4; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(0 == mp_add_~b3~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(1 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(2 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(3 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(1 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(2 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(3 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(1 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(2 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(3 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(0 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(2 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(3 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(0 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(2 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(3 == mp_add_~i~0#1 % 256); {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {14550#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(0 == mp_add_~i~0#1 % 256); {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,944 INFO L290 TraceCheckUtils]: 42: Hoare triple {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(1 == mp_add_~i~0#1 % 256); {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,944 INFO L290 TraceCheckUtils]: 43: Hoare triple {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(3 == mp_add_~i~0#1 % 256); {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,945 INFO L290 TraceCheckUtils]: 45: Hoare triple {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(0 == mp_add_~i~0#1 % 256); {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(1 == mp_add_~i~0#1 % 256); {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !(3 == mp_add_~i~0#1 % 256); {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} is VALID [2022-02-20 14:34:43,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {14551#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (= |ULTIMATE.start_mp_add_~carry~0#1| 0) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|))} assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {14552#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|) (= |ULTIMATE.start_mp_add_~partial_sum~0#1| 0))} is VALID [2022-02-20 14:34:43,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {14552#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|) (= |ULTIMATE.start_mp_add_~partial_sum~0#1| 0))} assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); {14552#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|) (= |ULTIMATE.start_mp_add_~partial_sum~0#1| 0))} is VALID [2022-02-20 14:34:43,948 INFO L290 TraceCheckUtils]: 53: Hoare triple {14552#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|) (= |ULTIMATE.start_mp_add_~partial_sum~0#1| 0))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {14552#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|) (= |ULTIMATE.start_mp_add_~partial_sum~0#1| 0))} is VALID [2022-02-20 14:34:43,949 INFO L290 TraceCheckUtils]: 54: Hoare triple {14552#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|) (= |ULTIMATE.start_mp_add_~partial_sum~0#1| 0))} assume !(0 == mp_add_~i~0#1 % 256); {14552#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|) (= |ULTIMATE.start_mp_add_~partial_sum~0#1| 0))} is VALID [2022-02-20 14:34:43,949 INFO L290 TraceCheckUtils]: 55: Hoare triple {14552#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|) (= |ULTIMATE.start_mp_add_~partial_sum~0#1| 0))} assume !(1 == mp_add_~i~0#1 % 256); {14552#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|) (= |ULTIMATE.start_mp_add_~partial_sum~0#1| 0))} is VALID [2022-02-20 14:34:43,949 INFO L290 TraceCheckUtils]: 56: Hoare triple {14552#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|) (= |ULTIMATE.start_mp_add_~partial_sum~0#1| 0))} assume !(2 == mp_add_~i~0#1 % 256); {14552#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|) (= |ULTIMATE.start_mp_add_~partial_sum~0#1| 0))} is VALID [2022-02-20 14:34:43,950 INFO L290 TraceCheckUtils]: 57: Hoare triple {14552#(and (<= |ULTIMATE.start_mp_add_~b3~0#1| 13) (<= 13 |ULTIMATE.start_mp_add_~b3~0#1|) (= |ULTIMATE.start_mp_add_~partial_sum~0#1| 0))} assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; {14553#(<= 13 (+ |ULTIMATE.start_mp_add_~partial_sum~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~partial_sum~0#1|) 13) 256))))} is VALID [2022-02-20 14:34:43,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {14553#(<= 13 (+ |ULTIMATE.start_mp_add_~partial_sum~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~partial_sum~0#1|) 13) 256))))} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {14553#(<= 13 (+ |ULTIMATE.start_mp_add_~partial_sum~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~partial_sum~0#1|) 13) 256))))} is VALID [2022-02-20 14:34:43,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {14553#(<= 13 (+ |ULTIMATE.start_mp_add_~partial_sum~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~partial_sum~0#1|) 13) 256))))} assume !(0 == mp_add_~i~0#1 % 256); {14553#(<= 13 (+ |ULTIMATE.start_mp_add_~partial_sum~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~partial_sum~0#1|) 13) 256))))} is VALID [2022-02-20 14:34:43,951 INFO L290 TraceCheckUtils]: 60: Hoare triple {14553#(<= 13 (+ |ULTIMATE.start_mp_add_~partial_sum~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~partial_sum~0#1|) 13) 256))))} assume !(1 == mp_add_~i~0#1 % 256); {14553#(<= 13 (+ |ULTIMATE.start_mp_add_~partial_sum~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~partial_sum~0#1|) 13) 256))))} is VALID [2022-02-20 14:34:43,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {14553#(<= 13 (+ |ULTIMATE.start_mp_add_~partial_sum~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~partial_sum~0#1|) 13) 256))))} assume !(2 == mp_add_~i~0#1 % 256); {14553#(<= 13 (+ |ULTIMATE.start_mp_add_~partial_sum~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~partial_sum~0#1|) 13) 256))))} is VALID [2022-02-20 14:34:43,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {14553#(<= 13 (+ |ULTIMATE.start_mp_add_~partial_sum~0#1| (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~partial_sum~0#1|) 13) 256))))} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; {14554#(<= (+ (* (div |ULTIMATE.start_mp_add_~r3~0#1| 256) 256) 13) |ULTIMATE.start_mp_add_~r3~0#1|)} is VALID [2022-02-20 14:34:43,953 INFO L290 TraceCheckUtils]: 63: Hoare triple {14554#(<= (+ (* (div |ULTIMATE.start_mp_add_~r3~0#1| 256) 256) 13) |ULTIMATE.start_mp_add_~r3~0#1|)} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {14554#(<= (+ (* (div |ULTIMATE.start_mp_add_~r3~0#1| 256) 256) 13) |ULTIMATE.start_mp_add_~r3~0#1|)} is VALID [2022-02-20 14:34:43,953 INFO L290 TraceCheckUtils]: 64: Hoare triple {14554#(<= (+ (* (div |ULTIMATE.start_mp_add_~r3~0#1| 256) 256) 13) |ULTIMATE.start_mp_add_~r3~0#1|)} assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); {14554#(<= (+ (* (div |ULTIMATE.start_mp_add_~r3~0#1| 256) 256) 13) |ULTIMATE.start_mp_add_~r3~0#1|)} is VALID [2022-02-20 14:34:43,954 INFO L290 TraceCheckUtils]: 65: Hoare triple {14554#(<= (+ (* (div |ULTIMATE.start_mp_add_~r3~0#1| 256) 256) 13) |ULTIMATE.start_mp_add_~r3~0#1|)} assume !(mp_add_~i~0#1 % 256 < 4); {14554#(<= (+ (* (div |ULTIMATE.start_mp_add_~r3~0#1| 256) 256) 13) |ULTIMATE.start_mp_add_~r3~0#1|)} is VALID [2022-02-20 14:34:43,955 INFO L290 TraceCheckUtils]: 66: Hoare triple {14554#(<= (+ (* (div |ULTIMATE.start_mp_add_~r3~0#1| 256) 256) 13) |ULTIMATE.start_mp_add_~r3~0#1|)} assume (1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) && (0 == 16777216 * (mp_add_~r3~0#1 % 256) || 1 == 16777216 * (mp_add_~r3~0#1 % 256))) || ((0 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256))))) || 1 == (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 0 == 65536 * (mp_add_~r2~0#1 % 256) then (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) else (if 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256)) then 65536 * (mp_add_~r2~0#1 % 256) else (if (1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) && (1 == 65536 * (mp_add_~r2~0#1 % 256) || 0 == 65536 * (mp_add_~r2~0#1 % 256))) || ((1 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))) || 0 == (if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256)))))) && 1 == 65536 * (mp_add_~r2~0#1 % 256)) then 1 else ~bitwiseOr((if (1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 0 == 256 * (mp_add_~r1~0#1 % 256) then mp_add_~r0~0#1 % 256 else (if 0 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256)) then 256 * (mp_add_~r1~0#1 % 256) else (if (1 == mp_add_~r0~0#1 % 256 && (1 == 256 * (mp_add_~r1~0#1 % 256) || 0 == 256 * (mp_add_~r1~0#1 % 256))) || ((1 == mp_add_~r0~0#1 % 256 || 0 == mp_add_~r0~0#1 % 256) && 1 == 256 * (mp_add_~r1~0#1 % 256)) then 1 else ~bitwiseOr(mp_add_~r0~0#1 % 256, 256 * (mp_add_~r1~0#1 % 256))))), 65536 * (mp_add_~r2~0#1 % 256)))))) && 1 == 16777216 * (mp_add_~r3~0#1 % 256));mp_add_~r~0#1 := 1; {14549#false} is VALID [2022-02-20 14:34:43,955 INFO L290 TraceCheckUtils]: 67: Hoare triple {14549#false} mp_add_#res#1 := mp_add_~r~0#1; {14549#false} is VALID [2022-02-20 14:34:43,955 INFO L290 TraceCheckUtils]: 68: Hoare triple {14549#false} main_#t~ret4#1 := mp_add_#res#1;assume { :end_inline_mp_add } true;main_~r~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~1#1 % 4294967296 == (main_~a~0#1 + main_~b~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {14549#false} is VALID [2022-02-20 14:34:43,955 INFO L290 TraceCheckUtils]: 69: Hoare triple {14549#false} assume 0 == __VERIFIER_assert_~cond#1; {14549#false} is VALID [2022-02-20 14:34:43,956 INFO L290 TraceCheckUtils]: 70: Hoare triple {14549#false} assume !false; {14549#false} is VALID [2022-02-20 14:34:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 14:34:43,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:43,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636504919] [2022-02-20 14:34:43,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636504919] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:34:43,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902535329] [2022-02-20 14:34:43,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:43,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:34:43,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:34:43,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:34:43,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 14:34:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:44,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 14:34:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:44,090 INFO L286 TraceCheckSpWp]: Computing forward predicates...