./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.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_1-1.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 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:34:24,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:34:24,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:34:24,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:34:24,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:34:24,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:34:24,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:34:24,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:34:24,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:34:24,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:34:24,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:34:24,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:34:24,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:34:24,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:34:24,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:34:24,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:34:24,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:34:24,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:34:24,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:34:24,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:34:24,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:34:24,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:34:24,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:34:24,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:34:24,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:34:24,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:34:24,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:34:24,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:34:24,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:34:24,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:34:24,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:34:24,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:34:24,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:34:24,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:34:24,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:34:24,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:34:24,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:34:24,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:34:24,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:34:24,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:34:24,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:34:24,556 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:24,580 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:34:24,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:34:24,581 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:34:24,581 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:34:24,581 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:34:24,581 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:34:24,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:34:24,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:34:24,582 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:34:24,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:34:24,583 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:34:24,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:34:24,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:34:24,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:34:24,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:34:24,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:34:24,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:34:24,584 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:34:24,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:34:24,584 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:34:24,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:34:24,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:34:24,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:34:24,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:34:24,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:34:24,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:34:24,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:34:24,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:34:24,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:34:24,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:34:24,586 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:34:24,586 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:34:24,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:34:24,586 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 -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2022-02-20 14:34:24,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:34:24,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:34:24,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:34:24,783 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:34:24,784 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:34:24,785 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2022-02-20 14:34:24,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0a4d6688/edf98ade137646899f665872c88a8592/FLAGeeecad26f [2022-02-20 14:34:25,164 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:34:25,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2022-02-20 14:34:25,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0a4d6688/edf98ade137646899f665872c88a8592/FLAGeeecad26f [2022-02-20 14:34:25,580 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0a4d6688/edf98ade137646899f665872c88a8592 [2022-02-20 14:34:25,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:34:25,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:34:25,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:34:25,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:34:25,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:34:25,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:34:25" (1/1) ... [2022-02-20 14:34:25,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d0386b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:25, skipping insertion in model container [2022-02-20 14:34:25,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:34:25" (1/1) ... [2022-02-20 14:34:25,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:34:25,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:34:25,738 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_1-1.i[1168,1181] [2022-02-20 14:34:25,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:34:25,779 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:34:25,787 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_1-1.i[1168,1181] [2022-02-20 14:34:25,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:34:25,834 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:34:25,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:25 WrapperNode [2022-02-20 14:34:25,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:34:25,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:34:25,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:34:25,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:34:25,847 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:25" (1/1) ... [2022-02-20 14:34:25,855 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:25" (1/1) ... [2022-02-20 14:34:25,913 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 145 [2022-02-20 14:34:25,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:34:25,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:34:25,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:34:25,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:34:25,920 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:25" (1/1) ... [2022-02-20 14:34:25,920 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:25" (1/1) ... [2022-02-20 14:34:25,931 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:25" (1/1) ... [2022-02-20 14:34:25,931 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:25" (1/1) ... [2022-02-20 14:34:25,945 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:25" (1/1) ... [2022-02-20 14:34:25,949 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:25" (1/1) ... [2022-02-20 14:34:25,953 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:25" (1/1) ... [2022-02-20 14:34:25,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:34:25,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:34:25,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:34:25,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:34:25,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:25" (1/1) ... [2022-02-20 14:34:25,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:34:25,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:34:25,992 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:25,999 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:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:34:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:34:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:34:26,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:34:26,148 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:34:26,149 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:34:26,587 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:34:26,591 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:34:26,591 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 14:34:26,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:34:26 BoogieIcfgContainer [2022-02-20 14:34:26,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:34:26,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:34:26,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:34:26,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:34:26,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:34:25" (1/3) ... [2022-02-20 14:34:26,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9030d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:34:26, skipping insertion in model container [2022-02-20 14:34:26,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:25" (2/3) ... [2022-02-20 14:34:26,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9030d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:34:26, skipping insertion in model container [2022-02-20 14:34:26,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:34:26" (3/3) ... [2022-02-20 14:34:26,598 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2022-02-20 14:34:26,601 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:34:26,601 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:34:26,646 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:34:26,653 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:26,653 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:34:26,665 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:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:34:26,669 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:26,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:26,670 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:26,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1979526715, now seen corresponding path program 1 times [2022-02-20 14:34:26,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:26,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936942697] [2022-02-20 14:34:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:26,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:26,825 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:26,825 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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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:26,826 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:26,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {54#true} mp_add_~nb~0#1 := 4; {54#true} is VALID [2022-02-20 14:34:26,826 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:26,826 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:26,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {54#true} assume !true; {55#false} is VALID [2022-02-20 14:34:26,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {55#false} assume !true; {55#false} is VALID [2022-02-20 14:34:26,834 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:26,835 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:26,835 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:26,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {55#false} assume 0 == __VERIFIER_assert_~cond#1; {55#false} is VALID [2022-02-20 14:34:26,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-02-20 14:34:26,837 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:26,837 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:26,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936942697] [2022-02-20 14:34:26,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936942697] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:26,838 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:26,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:34:26,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771684445] [2022-02-20 14:34:26,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:26,844 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:26,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:26,847 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:26,866 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:26,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:34:26,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:26,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:34:26,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:34:26,888 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:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:26,983 INFO L93 Difference]: Finished difference Result 92 states and 160 transitions. [2022-02-20 14:34:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:34:26,984 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:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:26,985 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:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 160 transitions. [2022-02-20 14:34:26,990 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:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 160 transitions. [2022-02-20 14:34:26,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 160 transitions. [2022-02-20 14:34:27,194 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:27,201 INFO L225 Difference]: With dead ends: 92 [2022-02-20 14:34:27,203 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 14:34:27,205 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:27,208 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:27,209 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:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 14:34:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 14:34:27,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:27,234 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:27,235 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:27,236 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:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:27,242 INFO L93 Difference]: Finished difference Result 47 states and 78 transitions. [2022-02-20 14:34:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-02-20 14:34:27,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:27,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:27,246 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:27,246 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:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:27,253 INFO L93 Difference]: Finished difference Result 47 states and 78 transitions. [2022-02-20 14:34:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-02-20 14:34:27,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:27,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:27,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:27,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:27,257 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:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-02-20 14:34:27,261 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 13 [2022-02-20 14:34:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:27,261 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-02-20 14:34:27,261 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:27,262 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-02-20 14:34:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:34:27,263 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:27,263 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:27,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:34:27,264 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:27,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:27,265 INFO L85 PathProgramCache]: Analyzing trace with hash 726479629, now seen corresponding path program 1 times [2022-02-20 14:34:27,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:27,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408560053] [2022-02-20 14:34:27,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:27,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:27,406 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:27,406 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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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:27,407 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:27,407 INFO L290 TraceCheckUtils]: 3: Hoare triple {301#true} mp_add_~nb~0#1 := 4; {301#true} is VALID [2022-02-20 14:34:27,407 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:27,407 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:27,408 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:27,408 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:27,408 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:27,409 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:27,409 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:27,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {302#false} assume 0 == __VERIFIER_assert_~cond#1; {302#false} is VALID [2022-02-20 14:34:27,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-02-20 14:34:27,412 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:27,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:27,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408560053] [2022-02-20 14:34:27,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408560053] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:27,413 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:27,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:34:27,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517321531] [2022-02-20 14:34:27,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:27,414 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:27,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:27,414 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:27,425 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:27,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:34:27,426 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:27,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:34:27,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:34:27,427 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:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:27,636 INFO L93 Difference]: Finished difference Result 112 states and 190 transitions. [2022-02-20 14:34:27,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:34:27,636 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:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:27,636 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:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2022-02-20 14:34:27,640 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:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2022-02-20 14:34:27,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 190 transitions. [2022-02-20 14:34:27,823 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:27,825 INFO L225 Difference]: With dead ends: 112 [2022-02-20 14:34:27,825 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 14:34:27,826 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:27,827 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:27,827 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:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 14:34:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-02-20 14:34:27,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:27,838 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:27,838 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:27,838 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:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:27,849 INFO L93 Difference]: Finished difference Result 75 states and 111 transitions. [2022-02-20 14:34:27,849 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2022-02-20 14:34:27,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:27,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:27,850 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:27,851 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:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:27,853 INFO L93 Difference]: Finished difference Result 75 states and 111 transitions. [2022-02-20 14:34:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2022-02-20 14:34:27,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:27,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:27,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:27,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:27,854 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:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2022-02-20 14:34:27,856 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 13 [2022-02-20 14:34:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:27,856 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2022-02-20 14:34:27,856 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:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2022-02-20 14:34:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:34:27,857 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:27,857 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:27,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:34:27,858 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:27,858 INFO L85 PathProgramCache]: Analyzing trace with hash 727939832, now seen corresponding path program 1 times [2022-02-20 14:34:27,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:27,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638643330] [2022-02-20 14:34:27,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:27,941 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:27,941 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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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:27,942 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:27,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {649#true} mp_add_~nb~0#1 := 4; {649#true} is VALID [2022-02-20 14:34:27,942 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:27,942 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:27,942 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:27,943 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:27,943 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:27,944 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:27,944 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:27,945 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:27,945 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:27,946 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:27,946 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:27,946 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:27,947 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:27,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {650#false} assume 0 == __VERIFIER_assert_~cond#1; {650#false} is VALID [2022-02-20 14:34:27,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-02-20 14:34:27,947 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:27,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:27,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638643330] [2022-02-20 14:34:27,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638643330] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:27,948 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:27,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:34:27,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123633918] [2022-02-20 14:34:27,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:27,949 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:27,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:27,949 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:27,964 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:27,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:34:27,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:27,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:34:27,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:34:27,966 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:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:28,319 INFO L93 Difference]: Finished difference Result 184 states and 301 transitions. [2022-02-20 14:34:28,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:34:28,319 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:28,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:28,319 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:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 277 transitions. [2022-02-20 14:34:28,321 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:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 277 transitions. [2022-02-20 14:34:28,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 277 transitions. [2022-02-20 14:34:28,525 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:28,529 INFO L225 Difference]: With dead ends: 184 [2022-02-20 14:34:28,530 INFO L226 Difference]: Without dead ends: 147 [2022-02-20 14:34:28,530 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:28,531 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:28,531 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:28,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-20 14:34:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 101. [2022-02-20 14:34:28,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:28,539 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:28,539 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:28,539 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:28,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:28,543 INFO L93 Difference]: Finished difference Result 147 states and 202 transitions. [2022-02-20 14:34:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 202 transitions. [2022-02-20 14:34:28,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:28,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:28,544 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:28,544 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:28,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:28,548 INFO L93 Difference]: Finished difference Result 147 states and 202 transitions. [2022-02-20 14:34:28,548 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 202 transitions. [2022-02-20 14:34:28,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:28,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:28,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:28,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:28,550 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:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2022-02-20 14:34:28,552 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 19 [2022-02-20 14:34:28,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:28,552 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2022-02-20 14:34:28,552 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:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2022-02-20 14:34:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:34:28,553 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:28,553 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:28,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:34:28,554 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:28,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:28,554 INFO L85 PathProgramCache]: Analyzing trace with hash -302552601, now seen corresponding path program 1 times [2022-02-20 14:34:28,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:28,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510595845] [2022-02-20 14:34:28,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:28,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:28,680 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:28,681 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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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:28,682 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:28,682 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:28,683 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:28,683 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:28,684 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:28,684 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:28,684 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:28,684 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:28,684 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:28,685 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:28,685 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:28,685 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:28,685 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:28,685 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:28,685 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:28,686 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:28,686 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:28,686 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:28,686 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:28,686 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:28,686 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:28,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {1248#false} assume 0 == __VERIFIER_assert_~cond#1; {1248#false} is VALID [2022-02-20 14:34:28,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {1248#false} assume !false; {1248#false} is VALID [2022-02-20 14:34:28,687 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:28,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:28,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510595845] [2022-02-20 14:34:28,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510595845] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:28,688 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:28,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:34:28,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791054415] [2022-02-20 14:34:28,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:28,688 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:28,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:28,689 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:28,702 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:28,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:34:28,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:28,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:34:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:34:28,703 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:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:29,082 INFO L93 Difference]: Finished difference Result 302 states and 441 transitions. [2022-02-20 14:34:29,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:34:29,082 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:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:29,083 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:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-02-20 14:34:29,084 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:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-02-20 14:34:29,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 237 transitions. [2022-02-20 14:34:29,248 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:29,251 INFO L225 Difference]: With dead ends: 302 [2022-02-20 14:34:29,251 INFO L226 Difference]: Without dead ends: 214 [2022-02-20 14:34:29,251 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:29,252 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:29,252 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:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-02-20 14:34:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 108. [2022-02-20 14:34:29,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:29,264 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:29,264 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:29,264 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:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:29,268 INFO L93 Difference]: Finished difference Result 214 states and 310 transitions. [2022-02-20 14:34:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 310 transitions. [2022-02-20 14:34:29,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:29,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:29,269 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:29,269 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:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:29,274 INFO L93 Difference]: Finished difference Result 214 states and 310 transitions. [2022-02-20 14:34:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 310 transitions. [2022-02-20 14:34:29,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:29,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:29,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:29,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:29,275 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:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2022-02-20 14:34:29,277 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 25 [2022-02-20 14:34:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:29,277 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2022-02-20 14:34:29,277 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:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2022-02-20 14:34:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:34:29,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:29,278 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:29,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:34:29,278 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:29,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:29,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1128243813, now seen corresponding path program 1 times [2022-02-20 14:34:29,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:29,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649115527] [2022-02-20 14:34:29,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:29,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:29,328 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:29,328 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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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; {2111#(and (<= 13 |ULTIMATE.start_mp_add_~a3~0#1|) (<= (div |ULTIMATE.start_mp_add_~a3~0#1| 256) 0))} is VALID [2022-02-20 14:34:29,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {2111#(and (<= 13 |ULTIMATE.start_mp_add_~a3~0#1|) (<= (div |ULTIMATE.start_mp_add_~a3~0#1| 256) 0))} assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; {2110#false} is VALID [2022-02-20 14:34:29,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {2110#false} assume !(0 == mp_add_~a2~0#1 % 256); {2110#false} is VALID [2022-02-20 14:34:29,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {2110#false} mp_add_~nb~0#1 := 4; {2110#false} is VALID [2022-02-20 14:34:29,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {2110#false} assume !(0 == mp_add_~b3~0#1 % 256); {2110#false} is VALID [2022-02-20 14:34:29,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {2110#false} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {2110#false} is VALID [2022-02-20 14:34:29,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {2110#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); {2110#false} is VALID [2022-02-20 14:34:29,330 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:29,330 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:29,330 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:29,330 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:29,331 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:29,331 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:29,331 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:29,331 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:29,331 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:29,331 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:29,331 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:29,332 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:29,332 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:29,332 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:29,332 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:29,332 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:29,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {2110#false} assume 0 == __VERIFIER_assert_~cond#1; {2110#false} is VALID [2022-02-20 14:34:29,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {2110#false} assume !false; {2110#false} is VALID [2022-02-20 14:34:29,333 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:29,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:29,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649115527] [2022-02-20 14:34:29,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649115527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:29,333 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:29,333 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:34:29,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790539045] [2022-02-20 14:34:29,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:29,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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:29,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:29,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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:29,348 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:29,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:34:29,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:29,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:34:29,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:34:29,349 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:29,427 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2022-02-20 14:34:29,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:34:29,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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:29,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-02-20 14:34:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-02-20 14:34:29,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 148 transitions. [2022-02-20 14:34:29,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:29,542 INFO L225 Difference]: With dead ends: 195 [2022-02-20 14:34:29,542 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 14:34:29,542 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:29,543 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 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:29,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 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:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 14:34:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-02-20 14:34:29,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:29,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 96 states have (on average 1.46875) internal successors, (141), 96 states have internal predecessors, (141), 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:29,567 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 96 states have (on average 1.46875) internal successors, (141), 96 states have internal predecessors, (141), 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:29,567 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 96 states have (on average 1.46875) internal successors, (141), 96 states have internal predecessors, (141), 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:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:29,569 INFO L93 Difference]: Finished difference Result 97 states and 141 transitions. [2022-02-20 14:34:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2022-02-20 14:34:29,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:29,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:29,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 96 states have (on average 1.46875) internal successors, (141), 96 states have internal predecessors, (141), 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 97 states. [2022-02-20 14:34:29,570 INFO L87 Difference]: Start difference. First operand has 97 states, 96 states have (on average 1.46875) internal successors, (141), 96 states have internal predecessors, (141), 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 97 states. [2022-02-20 14:34:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:29,572 INFO L93 Difference]: Finished difference Result 97 states and 141 transitions. [2022-02-20 14:34:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2022-02-20 14:34:29,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:29,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:29,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:29,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.46875) internal successors, (141), 96 states have internal predecessors, (141), 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:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2022-02-20 14:34:29,574 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 26 [2022-02-20 14:34:29,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:29,575 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2022-02-20 14:34:29,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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:29,575 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2022-02-20 14:34:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 14:34:29,576 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:29,576 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] [2022-02-20 14:34:29,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 14:34:29,576 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:29,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:29,576 INFO L85 PathProgramCache]: Analyzing trace with hash 479327523, now seen corresponding path program 1 times [2022-02-20 14:34:29,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:29,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803613539] [2022-02-20 14:34:29,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:29,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:29,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {2612#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); {2612#true} is VALID [2022-02-20 14:34:29,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {2612#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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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; {2612#true} is VALID [2022-02-20 14:34:29,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {2612#true} assume !(0 == mp_add_~a3~0#1 % 256); {2612#true} is VALID [2022-02-20 14:34:29,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {2612#true} mp_add_~nb~0#1 := 4; {2614#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:29,683 INFO L290 TraceCheckUtils]: 4: Hoare triple {2614#(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); {2614#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:29,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {2614#(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; {2615#(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:29,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {2615#(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; {2615#(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:29,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {2615#(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; {2615#(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:29,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {2615#(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_~a0~0#1 % 256; {2615#(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:29,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {2615#(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); {2615#(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:29,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {2615#(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); {2615#(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:29,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {2615#(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); {2615#(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:29,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {2615#(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); {2613#false} is VALID [2022-02-20 14:34:29,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {2613#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {2613#false} is VALID [2022-02-20 14:34:29,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {2613#false} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {2613#false} is VALID [2022-02-20 14:34:29,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {2613#false} assume !(1 == mp_add_~i~0#1 % 256); {2613#false} is VALID [2022-02-20 14:34:29,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {2613#false} assume !(2 == mp_add_~i~0#1 % 256); {2613#false} is VALID [2022-02-20 14:34:29,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {2613#false} assume !(3 == mp_add_~i~0#1 % 256); {2613#false} is VALID [2022-02-20 14:34:29,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {2613#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {2613#false} is VALID [2022-02-20 14:34:29,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {2613#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); {2613#false} is VALID [2022-02-20 14:34:29,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {2613#false} assume !!(mp_add_~i~0#1 % 256 < 4); {2613#false} is VALID [2022-02-20 14:34:29,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {2613#false} assume !(0 == mp_add_~i~0#1 % 256); {2613#false} is VALID [2022-02-20 14:34:29,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {2613#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; {2613#false} is VALID [2022-02-20 14:34:29,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {2613#false} assume !(2 == mp_add_~i~0#1 % 256); {2613#false} is VALID [2022-02-20 14:34:29,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {2613#false} assume !(3 == mp_add_~i~0#1 % 256); {2613#false} is VALID [2022-02-20 14:34:29,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {2613#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {2613#false} is VALID [2022-02-20 14:34:29,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {2613#false} assume !(mp_add_~i~0#1 % 256 < 4); {2613#false} is VALID [2022-02-20 14:34:29,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {2613#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; {2613#false} is VALID [2022-02-20 14:34:29,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {2613#false} mp_add_#res#1 := mp_add_~r~0#1; {2613#false} is VALID [2022-02-20 14:34:29,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {2613#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; {2613#false} is VALID [2022-02-20 14:34:29,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {2613#false} assume 0 == __VERIFIER_assert_~cond#1; {2613#false} is VALID [2022-02-20 14:34:29,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {2613#false} assume !false; {2613#false} is VALID [2022-02-20 14:34:29,689 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:29,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:29,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803613539] [2022-02-20 14:34:29,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803613539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:29,690 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:29,690 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:34:29,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996547847] [2022-02-20 14:34:29,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:29,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2022-02-20 14:34:29,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:29,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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:29,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:29,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:34:29,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:29,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:34:29,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:34:29,712 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:30,048 INFO L93 Difference]: Finished difference Result 292 states and 421 transitions. [2022-02-20 14:34:30,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:34:30,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2022-02-20 14:34:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-02-20 14:34:30,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-02-20 14:34:30,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2022-02-20 14:34:30,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:30,231 INFO L225 Difference]: With dead ends: 292 [2022-02-20 14:34:30,231 INFO L226 Difference]: Without dead ends: 206 [2022-02-20 14:34:30,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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:30,235 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 103 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:30,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 213 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:34:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-02-20 14:34:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 105. [2022-02-20 14:34:30,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:30,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 105 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 104 states have internal predecessors, (149), 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,263 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 105 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 104 states have internal predecessors, (149), 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,263 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 105 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 104 states have internal predecessors, (149), 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,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:30,277 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2022-02-20 14:34:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 293 transitions. [2022-02-20 14:34:30,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:30,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:30,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 104 states have internal predecessors, (149), 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 206 states. [2022-02-20 14:34:30,278 INFO L87 Difference]: Start difference. First operand has 105 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 104 states have internal predecessors, (149), 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 206 states. [2022-02-20 14:34:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:30,281 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2022-02-20 14:34:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 293 transitions. [2022-02-20 14:34:30,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:30,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:30,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:30,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 104 states have internal predecessors, (149), 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,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 149 transitions. [2022-02-20 14:34:30,284 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 149 transitions. Word has length 32 [2022-02-20 14:34:30,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:30,284 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 149 transitions. [2022-02-20 14:34:30,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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,284 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 149 transitions. [2022-02-20 14:34:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:34:30,286 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:30,286 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:30,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:34:30,286 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:30,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:30,287 INFO L85 PathProgramCache]: Analyzing trace with hash -91899916, now seen corresponding path program 1 times [2022-02-20 14:34:30,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:30,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968043325] [2022-02-20 14:34:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:30,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:30,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {3445#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); {3445#true} is VALID [2022-02-20 14:34:30,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {3445#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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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; {3445#true} is VALID [2022-02-20 14:34:30,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {3445#true} assume !(0 == mp_add_~a3~0#1 % 256); {3445#true} is VALID [2022-02-20 14:34:30,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {3445#true} mp_add_~nb~0#1 := 4; {3445#true} is VALID [2022-02-20 14:34:30,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {3445#true} assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; {3445#true} is VALID [2022-02-20 14:34:30,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {3445#true} assume !(0 == mp_add_~b2~0#1 % 256); {3445#true} is VALID [2022-02-20 14:34:30,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {3445#true} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {3445#true} is VALID [2022-02-20 14:34:30,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {3445#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; {3445#true} is VALID [2022-02-20 14:34:30,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {3445#true} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {3445#true} is VALID [2022-02-20 14:34:30,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {3445#true} 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; {3445#true} is VALID [2022-02-20 14:34:30,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {3445#true} assume !(1 == mp_add_~i~0#1 % 256); {3445#true} is VALID [2022-02-20 14:34:30,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {3445#true} assume !(2 == mp_add_~i~0#1 % 256); {3445#true} is VALID [2022-02-20 14:34:30,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {3445#true} assume !(3 == mp_add_~i~0#1 % 256); {3445#true} is VALID [2022-02-20 14:34:30,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {3445#true} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {3445#true} is VALID [2022-02-20 14:34:30,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {3445#true} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {3445#true} is VALID [2022-02-20 14:34:30,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {3445#true} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {3445#true} is VALID [2022-02-20 14:34:30,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {3445#true} assume !(1 == mp_add_~i~0#1 % 256); {3445#true} is VALID [2022-02-20 14:34:30,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {3445#true} assume !(2 == mp_add_~i~0#1 % 256); {3445#true} is VALID [2022-02-20 14:34:30,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {3445#true} assume !(3 == mp_add_~i~0#1 % 256); {3445#true} is VALID [2022-02-20 14:34:30,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {3445#true} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {3445#true} is VALID [2022-02-20 14:34:30,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {3445#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); {3445#true} is VALID [2022-02-20 14:34:30,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {3445#true} assume !!(mp_add_~i~0#1 % 256 < 4); {3445#true} is VALID [2022-02-20 14:34:30,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {3445#true} assume !(0 == mp_add_~i~0#1 % 256); {3445#true} is VALID [2022-02-20 14:34:30,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {3445#true} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; {3447#(<= |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:30,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {3447#(<= |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); {3447#(<= |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:30,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {3447#(<= |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); {3447#(<= |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:30,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {3447#(<= |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; {3448#(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:30,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {3448#(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); {3446#false} is VALID [2022-02-20 14:34:30,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {3446#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; {3446#false} is VALID [2022-02-20 14:34:30,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {3446#false} mp_add_#res#1 := mp_add_~r~0#1; {3446#false} is VALID [2022-02-20 14:34:30,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {3446#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; {3446#false} is VALID [2022-02-20 14:34:30,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {3446#false} assume 0 == __VERIFIER_assert_~cond#1; {3446#false} is VALID [2022-02-20 14:34:30,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {3446#false} assume !false; {3446#false} is VALID [2022-02-20 14:34:30,413 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:30,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:30,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968043325] [2022-02-20 14:34:30,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968043325] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:30,413 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:30,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:34:30,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382104949] [2022-02-20 14:34:30,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:30,414 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:30,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:30,415 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:30,435 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:30,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:34:30,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:30,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:34:30,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:34:30,436 INFO L87 Difference]: Start difference. First operand 105 states and 149 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:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:30,824 INFO L93 Difference]: Finished difference Result 299 states and 446 transitions. [2022-02-20 14:34:30,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:34:30,824 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:30,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:30,825 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:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2022-02-20 14:34:30,827 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:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2022-02-20 14:34:30,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 264 transitions. [2022-02-20 14:34:31,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:31,024 INFO L225 Difference]: With dead ends: 299 [2022-02-20 14:34:31,024 INFO L226 Difference]: Without dead ends: 213 [2022-02-20 14:34:31,025 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,025 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 119 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:31,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 102 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:34:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-02-20 14:34:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 148. [2022-02-20 14:34:31,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:31,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 148 states, 147 states have (on average 1.469387755102041) internal successors, (216), 147 states have internal predecessors, (216), 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,049 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 148 states, 147 states have (on average 1.469387755102041) internal successors, (216), 147 states have internal predecessors, (216), 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,049 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 148 states, 147 states have (on average 1.469387755102041) internal successors, (216), 147 states have internal predecessors, (216), 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,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:31,052 INFO L93 Difference]: Finished difference Result 213 states and 298 transitions. [2022-02-20 14:34:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2022-02-20 14:34:31,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:31,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:31,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 147 states have (on average 1.469387755102041) internal successors, (216), 147 states have internal predecessors, (216), 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 213 states. [2022-02-20 14:34:31,053 INFO L87 Difference]: Start difference. First operand has 148 states, 147 states have (on average 1.469387755102041) internal successors, (216), 147 states have internal predecessors, (216), 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 213 states. [2022-02-20 14:34:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:31,056 INFO L93 Difference]: Finished difference Result 213 states and 298 transitions. [2022-02-20 14:34:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2022-02-20 14:34:31,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:31,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:31,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:31,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:31,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.469387755102041) internal successors, (216), 147 states have internal predecessors, (216), 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,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2022-02-20 14:34:31,058 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 33 [2022-02-20 14:34:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:31,058 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2022-02-20 14:34:31,058 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:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2022-02-20 14:34:31,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 14:34:31,059 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:31,059 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:31,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 14:34:31,059 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:31,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:31,059 INFO L85 PathProgramCache]: Analyzing trace with hash 606666271, now seen corresponding path program 1 times [2022-02-20 14:34:31,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:31,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402691023] [2022-02-20 14:34:31,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:31,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:31,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {4342#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); {4342#true} is VALID [2022-02-20 14:34:31,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {4342#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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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; {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} is VALID [2022-02-20 14:34:31,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {4344#(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); {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} is VALID [2022-02-20 14:34:31,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} mp_add_~nb~0#1 := 4; {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} is VALID [2022-02-20 14:34:31,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {4344#(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;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} is VALID [2022-02-20 14:34:31,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume !(0 == mp_add_~b2~0#1 % 256); {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} is VALID [2022-02-20 14:34:31,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {4344#(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; {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} is VALID [2022-02-20 14:34:31,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~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);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} is VALID [2022-02-20 14:34:31,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} is VALID [2022-02-20 14:34:31,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~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_~a0~0#1 % 256; {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} is VALID [2022-02-20 14:34:31,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} assume !(1 == mp_add_~i~0#1 % 256); {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} is VALID [2022-02-20 14:34:31,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} assume !(2 == mp_add_~i~0#1 % 256); {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} is VALID [2022-02-20 14:34:31,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} assume !(3 == mp_add_~i~0#1 % 256); {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} is VALID [2022-02-20 14:34:31,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} is VALID [2022-02-20 14:34:31,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} is VALID [2022-02-20 14:34:31,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} is VALID [2022-02-20 14:34:31,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} assume !(1 == mp_add_~i~0#1 % 256); {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} is VALID [2022-02-20 14:34:31,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} assume !(2 == mp_add_~i~0#1 % 256); {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} is VALID [2022-02-20 14:34:31,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} assume !(3 == mp_add_~i~0#1 % 256); {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} is VALID [2022-02-20 14:34:31,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {4345#(and (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (= |ULTIMATE.start_mp_add_~i~0#1| 0) (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (div |ULTIMATE.start_mp_add_~na~0#1| 256))))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {4346#(<= (+ 4 (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 256))) |ULTIMATE.start_mp_add_~na~0#1|)} is VALID [2022-02-20 14:34:31,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {4346#(<= (+ 4 (* 256 (div |ULTIMATE.start_mp_add_~na~0#1| 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); {4347#(<= (+ (* (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:31,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {4347#(<= (+ (* (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); {4347#(<= (+ (* (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:31,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {4347#(<= (+ (* (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); {4347#(<= (+ (* (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:31,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {4347#(<= (+ (* (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; {4343#false} is VALID [2022-02-20 14:34:31,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {4343#false} assume !(2 == mp_add_~i~0#1 % 256); {4343#false} is VALID [2022-02-20 14:34:31,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {4343#false} assume !(3 == mp_add_~i~0#1 % 256); {4343#false} is VALID [2022-02-20 14:34:31,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {4343#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {4343#false} is VALID [2022-02-20 14:34:31,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {4343#false} assume !!(mp_add_~i~0#1 % 256 < 4); {4343#false} is VALID [2022-02-20 14:34:31,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {4343#false} assume !(0 == mp_add_~i~0#1 % 256); {4343#false} is VALID [2022-02-20 14:34:31,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {4343#false} assume !(1 == mp_add_~i~0#1 % 256); {4343#false} is VALID [2022-02-20 14:34:31,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {4343#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := 0; {4343#false} is VALID [2022-02-20 14:34:31,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {4343#false} assume !(3 == mp_add_~i~0#1 % 256); {4343#false} is VALID [2022-02-20 14:34:31,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {4343#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {4343#false} is VALID [2022-02-20 14:34:31,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {4343#false} assume !(mp_add_~i~0#1 % 256 < 4); {4343#false} is VALID [2022-02-20 14:34:31,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {4343#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; {4343#false} is VALID [2022-02-20 14:34:31,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {4343#false} mp_add_#res#1 := mp_add_~r~0#1; {4343#false} is VALID [2022-02-20 14:34:31,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {4343#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; {4343#false} is VALID [2022-02-20 14:34:31,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {4343#false} assume 0 == __VERIFIER_assert_~cond#1; {4343#false} is VALID [2022-02-20 14:34:31,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {4343#false} assume !false; {4343#false} is VALID [2022-02-20 14:34:31,243 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:31,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:31,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402691023] [2022-02-20 14:34:31,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402691023] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:34:31,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478253602] [2022-02-20 14:34:31,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:31,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:34:31,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:34:31,245 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:31,274 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:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:31,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:34:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:31,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:34:32,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {4342#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); {4342#true} is VALID [2022-02-20 14:34:32,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {4342#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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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; {4344#(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,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {4344#(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); {4344#(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,111 INFO L290 TraceCheckUtils]: 3: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} mp_add_~nb~0#1 := 4; {4344#(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 {4344#(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;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; {4344#(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]: 5: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume !(0 == mp_add_~b2~0#1 % 256); {4344#(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]: 6: Hoare triple {4344#(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; {4344#(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]: 7: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |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; {4344#(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]: 8: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {4375#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) (mod |ULTIMATE.start_mp_add_~na~0#1| 256)))} is VALID [2022-02-20 14:34:32,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {4375#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) (mod |ULTIMATE.start_mp_add_~na~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_~a0~0#1 % 256; {4344#(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,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume !(1 == mp_add_~i~0#1 % 256); {4344#(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,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume !(2 == mp_add_~i~0#1 % 256); {4344#(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,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume !(3 == mp_add_~i~0#1 % 256); {4344#(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,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {4344#(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,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {4344#(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,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {4344#(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,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume !(1 == mp_add_~i~0#1 % 256); {4344#(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,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume !(2 == mp_add_~i~0#1 % 256); {4344#(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,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} assume !(3 == mp_add_~i~0#1 % 256); {4344#(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,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {4344#(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,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {4344#(and (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 4 |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); {4347#(<= (+ (* (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:32,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {4347#(<= (+ (* (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); {4347#(<= (+ (* (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:32,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {4347#(<= (+ (* (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); {4347#(<= (+ (* (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:32,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {4347#(<= (+ (* (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; {4343#false} is VALID [2022-02-20 14:34:32,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {4343#false} assume !(2 == mp_add_~i~0#1 % 256); {4343#false} is VALID [2022-02-20 14:34:32,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {4343#false} assume !(3 == mp_add_~i~0#1 % 256); {4343#false} is VALID [2022-02-20 14:34:32,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {4343#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {4343#false} is VALID [2022-02-20 14:34:32,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {4343#false} assume !!(mp_add_~i~0#1 % 256 < 4); {4343#false} is VALID [2022-02-20 14:34:32,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {4343#false} assume !(0 == mp_add_~i~0#1 % 256); {4343#false} is VALID [2022-02-20 14:34:32,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {4343#false} assume !(1 == mp_add_~i~0#1 % 256); {4343#false} is VALID [2022-02-20 14:34:32,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {4343#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := 0; {4343#false} is VALID [2022-02-20 14:34:32,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {4343#false} assume !(3 == mp_add_~i~0#1 % 256); {4343#false} is VALID [2022-02-20 14:34:32,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {4343#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {4343#false} is VALID [2022-02-20 14:34:32,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {4343#false} assume !(mp_add_~i~0#1 % 256 < 4); {4343#false} is VALID [2022-02-20 14:34:32,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {4343#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; {4343#false} is VALID [2022-02-20 14:34:32,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {4343#false} mp_add_#res#1 := mp_add_~r~0#1; {4343#false} is VALID [2022-02-20 14:34:32,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {4343#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; {4343#false} is VALID [2022-02-20 14:34:32,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {4343#false} assume 0 == __VERIFIER_assert_~cond#1; {4343#false} is VALID [2022-02-20 14:34:32,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {4343#false} assume !false; {4343#false} is VALID [2022-02-20 14:34:32,120 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:32,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:34:32,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478253602] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:32,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:34:32,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 14:34:32,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705392040] [2022-02-20 14:34:32,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:32,121 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 39 [2022-02-20 14:34:32,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:32,121 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:32,157 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:32,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:34:32,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:32,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:34:32,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:34:32,158 INFO L87 Difference]: Start difference. First operand 148 states and 216 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:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:32,458 INFO L93 Difference]: Finished difference Result 323 states and 480 transitions. [2022-02-20 14:34:32,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:34:32,458 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 39 [2022-02-20 14:34:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:32,458 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:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2022-02-20 14:34:32,459 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:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2022-02-20 14:34:32,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 155 transitions. [2022-02-20 14:34:32,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:32,575 INFO L225 Difference]: With dead ends: 323 [2022-02-20 14:34:32,575 INFO L226 Difference]: Without dead ends: 181 [2022-02-20 14:34:32,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 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:32,576 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 100 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:32,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 86 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:34:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-20 14:34:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2022-02-20 14:34:32,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:32,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 163 states, 162 states have (on average 1.4012345679012346) internal successors, (227), 162 states have internal predecessors, (227), 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,607 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 163 states, 162 states have (on average 1.4012345679012346) internal successors, (227), 162 states have internal predecessors, (227), 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,608 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 163 states, 162 states have (on average 1.4012345679012346) internal successors, (227), 162 states have internal predecessors, (227), 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,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:32,610 INFO L93 Difference]: Finished difference Result 181 states and 247 transitions. [2022-02-20 14:34:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 247 transitions. [2022-02-20 14:34:32,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:32,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:32,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 162 states have (on average 1.4012345679012346) internal successors, (227), 162 states have internal predecessors, (227), 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 181 states. [2022-02-20 14:34:32,610 INFO L87 Difference]: Start difference. First operand has 163 states, 162 states have (on average 1.4012345679012346) internal successors, (227), 162 states have internal predecessors, (227), 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 181 states. [2022-02-20 14:34:32,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:32,612 INFO L93 Difference]: Finished difference Result 181 states and 247 transitions. [2022-02-20 14:34:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 247 transitions. [2022-02-20 14:34:32,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:32,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:32,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:32,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4012345679012346) internal successors, (227), 162 states have internal predecessors, (227), 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,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 227 transitions. [2022-02-20 14:34:32,615 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 227 transitions. Word has length 39 [2022-02-20 14:34:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:32,615 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 227 transitions. [2022-02-20 14:34:32,615 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:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 227 transitions. [2022-02-20 14:34:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 14:34:32,615 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:32,616 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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:32,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:34:32,816 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:32,816 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:32,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash -678904147, now seen corresponding path program 1 times [2022-02-20 14:34:32,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:32,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053153294] [2022-02-20 14:34:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:32,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:32,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {5331#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); {5331#true} is VALID [2022-02-20 14:34:32,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {5331#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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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; {5331#true} is VALID [2022-02-20 14:34:32,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {5331#true} assume !(0 == mp_add_~a3~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {5331#true} mp_add_~nb~0#1 := 4; {5331#true} is VALID [2022-02-20 14:34:32,946 INFO L290 TraceCheckUtils]: 4: Hoare triple {5331#true} assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; {5331#true} is VALID [2022-02-20 14:34:32,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {5331#true} assume !(0 == mp_add_~b2~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {5331#true} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {5331#true} is VALID [2022-02-20 14:34:32,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {5331#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; {5331#true} is VALID [2022-02-20 14:34:32,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {5331#true} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {5331#true} is VALID [2022-02-20 14:34:32,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {5331#true} 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; {5331#true} is VALID [2022-02-20 14:34:32,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {5331#true} assume !(1 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {5331#true} assume !(2 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {5331#true} assume !(3 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {5331#true} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {5331#true} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {5331#true} is VALID [2022-02-20 14:34:32,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {5331#true} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {5331#true} is VALID [2022-02-20 14:34:32,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {5331#true} assume !(1 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {5331#true} assume !(2 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {5331#true} assume !(3 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {5331#true} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {5331#true} is VALID [2022-02-20 14:34:32,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {5331#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; {5331#true} is VALID [2022-02-20 14:34:32,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {5331#true} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {5331#true} is VALID [2022-02-20 14:34:32,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {5331#true} assume !(0 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {5331#true} assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; {5331#true} is VALID [2022-02-20 14:34:32,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {5331#true} assume !(2 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {5331#true} assume !(3 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {5331#true} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {5331#true} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {5331#true} is VALID [2022-02-20 14:34:32,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {5331#true} assume !(0 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {5331#true} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {5331#true} is VALID [2022-02-20 14:34:32,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {5331#true} assume !(2 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {5331#true} assume !(3 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {5331#true} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {5331#true} is VALID [2022-02-20 14:34:32,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {5331#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; {5331#true} is VALID [2022-02-20 14:34:32,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {5331#true} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {5331#true} is VALID [2022-02-20 14:34:32,963 INFO L290 TraceCheckUtils]: 35: Hoare triple {5331#true} assume !(0 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,963 INFO L290 TraceCheckUtils]: 36: Hoare triple {5331#true} assume !(1 == mp_add_~i~0#1 % 256); {5331#true} is VALID [2022-02-20 14:34:32,964 INFO L290 TraceCheckUtils]: 37: Hoare triple {5331#true} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} is VALID [2022-02-20 14:34:32,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} assume !(3 == mp_add_~i~0#1 % 256); {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} is VALID [2022-02-20 14:34:32,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} is VALID [2022-02-20 14:34:32,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} is VALID [2022-02-20 14:34:32,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} assume !(0 == mp_add_~i~0#1 % 256); {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} is VALID [2022-02-20 14:34:32,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} assume !(1 == mp_add_~i~0#1 % 256); {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} is VALID [2022-02-20 14:34:32,967 INFO L290 TraceCheckUtils]: 43: Hoare triple {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} is VALID [2022-02-20 14:34:32,967 INFO L290 TraceCheckUtils]: 44: Hoare triple {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} assume !(3 == mp_add_~i~0#1 % 256); {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} is VALID [2022-02-20 14:34:32,969 INFO L290 TraceCheckUtils]: 45: Hoare triple {5333#(<= |ULTIMATE.start_mp_add_~i~0#1| (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) 2))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {5334#(and (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) 0)) (<= |ULTIMATE.start_mp_add_~i~0#1| 3))} is VALID [2022-02-20 14:34:32,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {5334#(and (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) 0)) (<= |ULTIMATE.start_mp_add_~i~0#1| 3))} 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); {5334#(and (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) 0)) (<= |ULTIMATE.start_mp_add_~i~0#1| 3))} is VALID [2022-02-20 14:34:32,969 INFO L290 TraceCheckUtils]: 47: Hoare triple {5334#(and (not (<= (+ (div |ULTIMATE.start_mp_add_~i~0#1| 256) 1) 0)) (<= |ULTIMATE.start_mp_add_~i~0#1| 3))} assume !(mp_add_~i~0#1 % 256 < 4); {5332#false} is VALID [2022-02-20 14:34:32,970 INFO L290 TraceCheckUtils]: 48: Hoare triple {5332#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; {5332#false} is VALID [2022-02-20 14:34:32,970 INFO L290 TraceCheckUtils]: 49: Hoare triple {5332#false} mp_add_#res#1 := mp_add_~r~0#1; {5332#false} is VALID [2022-02-20 14:34:32,970 INFO L290 TraceCheckUtils]: 50: Hoare triple {5332#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; {5332#false} is VALID [2022-02-20 14:34:32,970 INFO L290 TraceCheckUtils]: 51: Hoare triple {5332#false} assume 0 == __VERIFIER_assert_~cond#1; {5332#false} is VALID [2022-02-20 14:34:32,970 INFO L290 TraceCheckUtils]: 52: Hoare triple {5332#false} assume !false; {5332#false} is VALID [2022-02-20 14:34:32,970 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-20 14:34:32,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:32,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053153294] [2022-02-20 14:34:32,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053153294] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:32,972 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:32,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:34:32,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922079861] [2022-02-20 14:34:32,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:32,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 53 [2022-02-20 14:34:32,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:32,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:33,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:34:33,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:33,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:34:33,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:34:33,008 INFO L87 Difference]: Start difference. First operand 163 states and 227 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:33,318 INFO L93 Difference]: Finished difference Result 442 states and 625 transitions. [2022-02-20 14:34:33,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:34:33,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 53 [2022-02-20 14:34:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2022-02-20 14:34:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2022-02-20 14:34:33,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 220 transitions. [2022-02-20 14:34:33,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:33,528 INFO L225 Difference]: With dead ends: 442 [2022-02-20 14:34:33,528 INFO L226 Difference]: Without dead ends: 297 [2022-02-20 14:34:33,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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,530 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 109 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:33,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 98 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:34:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-02-20 14:34:33,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 215. [2022-02-20 14:34:33,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:33,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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,565 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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,566 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:33,570 INFO L93 Difference]: Finished difference Result 297 states and 412 transitions. [2022-02-20 14:34:33,570 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 412 transitions. [2022-02-20 14:34:33,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:33,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:33,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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 297 states. [2022-02-20 14:34:33,571 INFO L87 Difference]: Start difference. First operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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 297 states. [2022-02-20 14:34:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:33,575 INFO L93 Difference]: Finished difference Result 297 states and 412 transitions. [2022-02-20 14:34:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 412 transitions. [2022-02-20 14:34:33,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:33,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:33,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:33,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 307 transitions. [2022-02-20 14:34:33,579 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 307 transitions. Word has length 53 [2022-02-20 14:34:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:33,579 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 307 transitions. [2022-02-20 14:34:33,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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,579 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 307 transitions. [2022-02-20 14:34:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 14:34:33,590 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:33,591 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:33,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 14:34:33,591 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:33,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:33,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1974065164, now seen corresponding path program 1 times [2022-02-20 14:34:33,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:33,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223301994] [2022-02-20 14:34:33,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:33,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:33,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {6609#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); {6609#true} is VALID [2022-02-20 14:34:33,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {6609#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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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; {6609#true} is VALID [2022-02-20 14:34:33,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {6609#true} assume !(0 == mp_add_~a3~0#1 % 256); {6609#true} is VALID [2022-02-20 14:34:33,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {6609#true} mp_add_~nb~0#1 := 4; {6611#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:33,768 INFO L290 TraceCheckUtils]: 4: Hoare triple {6611#(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;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; {6612#(<= 3 (+ |ULTIMATE.start_mp_add_~nb~0#1| (* (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256) 256)))} is VALID [2022-02-20 14:34:33,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {6612#(<= 3 (+ |ULTIMATE.start_mp_add_~nb~0#1| (* (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256) 256)))} assume !(0 == mp_add_~b2~0#1 % 256); {6612#(<= 3 (+ |ULTIMATE.start_mp_add_~nb~0#1| (* (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256) 256)))} is VALID [2022-02-20 14:34:33,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {6612#(<= 3 (+ |ULTIMATE.start_mp_add_~nb~0#1| (* (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256) 256)))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} is VALID [2022-02-20 14:34:33,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} is VALID [2022-02-20 14:34:33,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} is VALID [2022-02-20 14:34:33,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~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; {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} is VALID [2022-02-20 14:34:33,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} assume !(1 == mp_add_~i~0#1 % 256); {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} is VALID [2022-02-20 14:34:33,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} assume !(2 == mp_add_~i~0#1 % 256); {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} is VALID [2022-02-20 14:34:33,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} assume !(3 == mp_add_~i~0#1 % 256); {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} is VALID [2022-02-20 14:34:33,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {6613#(and (= |ULTIMATE.start_mp_add_~i~0#1| 0) (<= (+ 3 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {6610#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {6610#false} is VALID [2022-02-20 14:34:33,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {6610#false} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {6610#false} is VALID [2022-02-20 14:34:33,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {6610#false} assume !(1 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {6610#false} assume !(2 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {6610#false} assume !(3 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {6610#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {6610#false} is VALID [2022-02-20 14:34:33,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {6610#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; {6610#false} is VALID [2022-02-20 14:34:33,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {6610#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {6610#false} is VALID [2022-02-20 14:34:33,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {6610#false} assume !(0 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {6610#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; {6610#false} is VALID [2022-02-20 14:34:33,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {6610#false} assume !(2 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {6610#false} assume !(3 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {6610#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {6610#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {6610#false} assume !(0 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {6610#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {6610#false} assume !(2 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {6610#false} assume !(3 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {6610#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {6610#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; {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {6610#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {6610#false} assume !(0 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {6610#false} assume !(1 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {6610#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {6610#false} assume !(3 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {6610#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {6610#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {6610#false} assume !(0 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {6610#false} assume !(1 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {6610#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {6610#false} assume !(3 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {6610#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {6610#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; {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {6610#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {6610#false} assume !(0 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {6610#false} assume !(1 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 50: Hoare triple {6610#false} assume !(2 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 51: Hoare triple {6610#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 52: Hoare triple {6610#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {6610#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {6610#false} assume !(0 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {6610#false} assume !(1 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {6610#false} assume !(2 == mp_add_~i~0#1 % 256); {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {6610#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {6610#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {6610#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); {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 60: Hoare triple {6610#false} assume !(mp_add_~i~0#1 % 256 < 4); {6610#false} is VALID [2022-02-20 14:34:33,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {6610#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; {6610#false} is VALID [2022-02-20 14:34:33,787 INFO L290 TraceCheckUtils]: 62: Hoare triple {6610#false} mp_add_#res#1 := mp_add_~r~0#1; {6610#false} is VALID [2022-02-20 14:34:33,787 INFO L290 TraceCheckUtils]: 63: Hoare triple {6610#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; {6610#false} is VALID [2022-02-20 14:34:33,787 INFO L290 TraceCheckUtils]: 64: Hoare triple {6610#false} assume 0 == __VERIFIER_assert_~cond#1; {6610#false} is VALID [2022-02-20 14:34:33,787 INFO L290 TraceCheckUtils]: 65: Hoare triple {6610#false} assume !false; {6610#false} is VALID [2022-02-20 14:34:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 14:34:33,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:33,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223301994] [2022-02-20 14:34:33,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223301994] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:33,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:33,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:34:33,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138668176] [2022-02-20 14:34:33,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:33,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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:33,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:33,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:33,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:34:33,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:33,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:34:33,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:34:33,826 INFO L87 Difference]: Start difference. First operand 215 states and 307 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:34,524 INFO L93 Difference]: Finished difference Result 841 states and 1205 transitions. [2022-02-20 14:34:34,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:34:34,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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:34,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 270 transitions. [2022-02-20 14:34:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 270 transitions. [2022-02-20 14:34:34,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 270 transitions. [2022-02-20 14:34:34,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:34,746 INFO L225 Difference]: With dead ends: 841 [2022-02-20 14:34:34,746 INFO L226 Difference]: Without dead ends: 645 [2022-02-20 14:34:34,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:34,747 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 187 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:34,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 340 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:34:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-02-20 14:34:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 215. [2022-02-20 14:34:34,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:34,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 645 states. Second operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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,781 INFO L74 IsIncluded]: Start isIncluded. First operand 645 states. Second operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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,781 INFO L87 Difference]: Start difference. First operand 645 states. Second operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:34,795 INFO L93 Difference]: Finished difference Result 645 states and 919 transitions. [2022-02-20 14:34:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2022-02-20 14:34:34,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:34,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:34,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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 645 states. [2022-02-20 14:34:34,796 INFO L87 Difference]: Start difference. First operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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 645 states. [2022-02-20 14:34:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:34,809 INFO L93 Difference]: Finished difference Result 645 states and 919 transitions. [2022-02-20 14:34:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2022-02-20 14:34:34,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:34,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:34,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:34,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 307 transitions. [2022-02-20 14:34:34,813 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 307 transitions. Word has length 66 [2022-02-20 14:34:34,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:34,813 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 307 transitions. [2022-02-20 14:34:34,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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,813 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 307 transitions. [2022-02-20 14:34:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 14:34:34,814 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:34,814 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:34,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 14:34:34,814 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:34,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:34,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1724423468, now seen corresponding path program 1 times [2022-02-20 14:34:34,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:34,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334017849] [2022-02-20 14:34:34,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:34,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:34,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {8996#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); {8996#true} is VALID [2022-02-20 14:34:34,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {8996#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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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; {8996#true} is VALID [2022-02-20 14:34:34,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {8996#true} assume !(0 == mp_add_~a3~0#1 % 256); {8996#true} is VALID [2022-02-20 14:34:34,920 INFO L290 TraceCheckUtils]: 3: Hoare triple {8996#true} mp_add_~nb~0#1 := 4; {8998#(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,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {8998#(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;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; {8999#(<= 3 (+ |ULTIMATE.start_mp_add_~nb~0#1| (* (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256) 256)))} is VALID [2022-02-20 14:34:34,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {8999#(<= 3 (+ |ULTIMATE.start_mp_add_~nb~0#1| (* (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256) 256)))} assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; {9000#(<= 2 (+ (* 256 (div (+ 2 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256)) |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:34,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {9000#(<= 2 (+ (* 256 (div (+ 2 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256)) |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(0 == mp_add_~b1~0#1 % 256); {9000#(<= 2 (+ (* 256 (div (+ 2 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256)) |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:34,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {9000#(<= 2 (+ (* 256 (div (+ 2 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256)) |ULTIMATE.start_mp_add_~nb~0#1|))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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; {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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; {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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_~a0~0#1 % 256; {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(1 == mp_add_~i~0#1 % 256); {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(2 == mp_add_~i~0#1 % 256); {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(3 == mp_add_~i~0#1 % 256); {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:34,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {9001#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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); {8997#false} is VALID [2022-02-20 14:34:34,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {8997#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {8997#false} is VALID [2022-02-20 14:34:34,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {8997#false} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {8997#false} is VALID [2022-02-20 14:34:34,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {8997#false} assume !(1 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {8997#false} assume !(2 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {8997#false} assume !(3 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {8997#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {8997#false} is VALID [2022-02-20 14:34:34,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {8997#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; {8997#false} is VALID [2022-02-20 14:34:34,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {8997#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {8997#false} is VALID [2022-02-20 14:34:34,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {8997#false} assume !(0 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {8997#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; {8997#false} is VALID [2022-02-20 14:34:34,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {8997#false} assume !(2 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {8997#false} assume !(3 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {8997#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {8997#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {8997#false} is VALID [2022-02-20 14:34:34,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {8997#false} assume !(0 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {8997#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {8997#false} is VALID [2022-02-20 14:34:34,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {8997#false} assume !(2 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {8997#false} assume !(3 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {8997#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {8997#false} is VALID [2022-02-20 14:34:34,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {8997#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; {8997#false} is VALID [2022-02-20 14:34:34,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {8997#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {8997#false} is VALID [2022-02-20 14:34:34,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {8997#false} assume !(0 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {8997#false} assume !(1 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {8997#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; {8997#false} is VALID [2022-02-20 14:34:34,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {8997#false} assume !(3 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,929 INFO L290 TraceCheckUtils]: 40: Hoare triple {8997#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,929 INFO L290 TraceCheckUtils]: 41: Hoare triple {8997#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {8997#false} is VALID [2022-02-20 14:34:34,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {8997#false} assume !(0 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {8997#false} assume !(1 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,930 INFO L290 TraceCheckUtils]: 44: Hoare triple {8997#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {8997#false} is VALID [2022-02-20 14:34:34,930 INFO L290 TraceCheckUtils]: 45: Hoare triple {8997#false} assume !(3 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,930 INFO L290 TraceCheckUtils]: 46: Hoare triple {8997#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {8997#false} is VALID [2022-02-20 14:34:34,930 INFO L290 TraceCheckUtils]: 47: Hoare triple {8997#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; {8997#false} is VALID [2022-02-20 14:34:34,930 INFO L290 TraceCheckUtils]: 48: Hoare triple {8997#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {8997#false} is VALID [2022-02-20 14:34:34,930 INFO L290 TraceCheckUtils]: 49: Hoare triple {8997#false} assume !(0 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,930 INFO L290 TraceCheckUtils]: 50: Hoare triple {8997#false} assume !(1 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {8997#false} assume !(2 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {8997#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; {8997#false} is VALID [2022-02-20 14:34:34,931 INFO L290 TraceCheckUtils]: 53: Hoare triple {8997#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,931 INFO L290 TraceCheckUtils]: 54: Hoare triple {8997#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {8997#false} is VALID [2022-02-20 14:34:34,931 INFO L290 TraceCheckUtils]: 55: Hoare triple {8997#false} assume !(0 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,931 INFO L290 TraceCheckUtils]: 56: Hoare triple {8997#false} assume !(1 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,931 INFO L290 TraceCheckUtils]: 57: Hoare triple {8997#false} assume !(2 == mp_add_~i~0#1 % 256); {8997#false} is VALID [2022-02-20 14:34:34,931 INFO L290 TraceCheckUtils]: 58: Hoare triple {8997#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; {8997#false} is VALID [2022-02-20 14:34:34,931 INFO L290 TraceCheckUtils]: 59: Hoare triple {8997#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {8997#false} is VALID [2022-02-20 14:34:34,931 INFO L290 TraceCheckUtils]: 60: Hoare triple {8997#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); {8997#false} is VALID [2022-02-20 14:34:34,931 INFO L290 TraceCheckUtils]: 61: Hoare triple {8997#false} assume !(mp_add_~i~0#1 % 256 < 4); {8997#false} is VALID [2022-02-20 14:34:34,931 INFO L290 TraceCheckUtils]: 62: Hoare triple {8997#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; {8997#false} is VALID [2022-02-20 14:34:34,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {8997#false} mp_add_#res#1 := mp_add_~r~0#1; {8997#false} is VALID [2022-02-20 14:34:34,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {8997#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; {8997#false} is VALID [2022-02-20 14:34:34,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {8997#false} assume 0 == __VERIFIER_assert_~cond#1; {8997#false} is VALID [2022-02-20 14:34:34,932 INFO L290 TraceCheckUtils]: 66: Hoare triple {8997#false} assume !false; {8997#false} is VALID [2022-02-20 14:34:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 14:34:34,932 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:34,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334017849] [2022-02-20 14:34:34,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334017849] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:34,933 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:34,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 14:34:34,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113742508] [2022-02-20 14:34:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:34,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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:34,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:34,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:34,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 14:34:34,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:34,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 14:34:34,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 14:34:34,960 INFO L87 Difference]: Start difference. First operand 215 states and 307 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:36,075 INFO L93 Difference]: Finished difference Result 1060 states and 1515 transitions. [2022-02-20 14:34:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:34:36,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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:36,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 347 transitions. [2022-02-20 14:34:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 347 transitions. [2022-02-20 14:34:36,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 347 transitions. [2022-02-20 14:34:36,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:36,372 INFO L225 Difference]: With dead ends: 1060 [2022-02-20 14:34:36,372 INFO L226 Difference]: Without dead ends: 864 [2022-02-20 14:34:36,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:34:36,374 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 281 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:36,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 577 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:34:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2022-02-20 14:34:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 215. [2022-02-20 14:34:36,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:36,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 864 states. Second operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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,414 INFO L74 IsIncluded]: Start isIncluded. First operand 864 states. Second operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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,414 INFO L87 Difference]: Start difference. First operand 864 states. Second operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:36,440 INFO L93 Difference]: Finished difference Result 864 states and 1229 transitions. [2022-02-20 14:34:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1229 transitions. [2022-02-20 14:34:36,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:36,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:36,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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 864 states. [2022-02-20 14:34:36,442 INFO L87 Difference]: Start difference. First operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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 864 states. [2022-02-20 14:34:36,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:36,468 INFO L93 Difference]: Finished difference Result 864 states and 1229 transitions. [2022-02-20 14:34:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1229 transitions. [2022-02-20 14:34:36,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:36,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:36,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:36,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 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,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 307 transitions. [2022-02-20 14:34:36,472 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 307 transitions. Word has length 67 [2022-02-20 14:34:36,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:36,473 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 307 transitions. [2022-02-20 14:34:36,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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,473 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 307 transitions. [2022-02-20 14:34:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 14:34:36,495 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:36,495 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:36,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 14:34:36,496 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 608969170, now seen corresponding path program 1 times [2022-02-20 14:34:36,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:36,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697222820] [2022-02-20 14:34:36,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:36,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:36,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {12049#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); {12049#true} is VALID [2022-02-20 14:34:36,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {12049#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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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; {12049#true} is VALID [2022-02-20 14:34:36,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {12049#true} assume !(0 == mp_add_~a3~0#1 % 256); {12049#true} is VALID [2022-02-20 14:34:36,626 INFO L290 TraceCheckUtils]: 3: Hoare triple {12049#true} mp_add_~nb~0#1 := 4; {12051#(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,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {12051#(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;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; {12052#(<= 3 (+ |ULTIMATE.start_mp_add_~nb~0#1| (* (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256) 256)))} is VALID [2022-02-20 14:34:36,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {12052#(<= 3 (+ |ULTIMATE.start_mp_add_~nb~0#1| (* (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256) 256)))} assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; {12053#(<= 2 (+ (* 256 (div (+ 2 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256)) |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:36,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {12053#(<= 2 (+ (* 256 (div (+ 2 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256)) |ULTIMATE.start_mp_add_~nb~0#1|))} assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; {12054#(<= 1 (+ (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|) 1) 256)) |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:36,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {12054#(<= 1 (+ (* 256 (div (+ (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|) 1) 256)) |ULTIMATE.start_mp_add_~nb~0#1|))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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; {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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; {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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_~a0~0#1 % 256; {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(1 == mp_add_~i~0#1 % 256); {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(2 == mp_add_~i~0#1 % 256); {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(3 == mp_add_~i~0#1 % 256); {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:36,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {12055#(and (<= (+ (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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); {12050#false} is VALID [2022-02-20 14:34:36,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {12050#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {12050#false} is VALID [2022-02-20 14:34:36,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {12050#false} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {12050#false} is VALID [2022-02-20 14:34:36,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {12050#false} assume !(1 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {12050#false} assume !(2 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {12050#false} assume !(3 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {12050#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {12050#false} is VALID [2022-02-20 14:34:36,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {12050#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; {12050#false} is VALID [2022-02-20 14:34:36,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {12050#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {12050#false} is VALID [2022-02-20 14:34:36,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {12050#false} assume !(0 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {12050#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; {12050#false} is VALID [2022-02-20 14:34:36,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {12050#false} assume !(2 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {12050#false} assume !(3 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {12050#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {12050#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {12050#false} is VALID [2022-02-20 14:34:36,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {12050#false} assume !(0 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {12050#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {12050#false} is VALID [2022-02-20 14:34:36,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {12050#false} assume !(2 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {12050#false} assume !(3 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {12050#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {12050#false} is VALID [2022-02-20 14:34:36,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {12050#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; {12050#false} is VALID [2022-02-20 14:34:36,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {12050#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {12050#false} is VALID [2022-02-20 14:34:36,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {12050#false} assume !(0 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {12050#false} assume !(1 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {12050#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; {12050#false} is VALID [2022-02-20 14:34:36,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {12050#false} assume !(3 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {12050#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {12050#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {12050#false} is VALID [2022-02-20 14:34:36,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {12050#false} assume !(0 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {12050#false} assume !(1 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {12050#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {12050#false} is VALID [2022-02-20 14:34:36,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {12050#false} assume !(3 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {12050#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {12050#false} is VALID [2022-02-20 14:34:36,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {12050#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; {12050#false} is VALID [2022-02-20 14:34:36,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {12050#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {12050#false} is VALID [2022-02-20 14:34:36,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {12050#false} assume !(0 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,636 INFO L290 TraceCheckUtils]: 50: Hoare triple {12050#false} assume !(1 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,637 INFO L290 TraceCheckUtils]: 51: Hoare triple {12050#false} assume !(2 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,637 INFO L290 TraceCheckUtils]: 52: Hoare triple {12050#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; {12050#false} is VALID [2022-02-20 14:34:36,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {12050#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {12050#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {12050#false} is VALID [2022-02-20 14:34:36,637 INFO L290 TraceCheckUtils]: 55: Hoare triple {12050#false} assume !(0 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,637 INFO L290 TraceCheckUtils]: 56: Hoare triple {12050#false} assume !(1 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {12050#false} assume !(2 == mp_add_~i~0#1 % 256); {12050#false} is VALID [2022-02-20 14:34:36,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {12050#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; {12050#false} is VALID [2022-02-20 14:34:36,637 INFO L290 TraceCheckUtils]: 59: Hoare triple {12050#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {12050#false} is VALID [2022-02-20 14:34:36,638 INFO L290 TraceCheckUtils]: 60: Hoare triple {12050#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); {12050#false} is VALID [2022-02-20 14:34:36,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {12050#false} assume !(mp_add_~i~0#1 % 256 < 4); {12050#false} is VALID [2022-02-20 14:34:36,638 INFO L290 TraceCheckUtils]: 62: Hoare triple {12050#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; {12050#false} is VALID [2022-02-20 14:34:36,638 INFO L290 TraceCheckUtils]: 63: Hoare triple {12050#false} mp_add_#res#1 := mp_add_~r~0#1; {12050#false} is VALID [2022-02-20 14:34:36,638 INFO L290 TraceCheckUtils]: 64: Hoare triple {12050#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; {12050#false} is VALID [2022-02-20 14:34:36,638 INFO L290 TraceCheckUtils]: 65: Hoare triple {12050#false} assume 0 == __VERIFIER_assert_~cond#1; {12050#false} is VALID [2022-02-20 14:34:36,638 INFO L290 TraceCheckUtils]: 66: Hoare triple {12050#false} assume !false; {12050#false} is VALID [2022-02-20 14:34:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 14:34:36,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:36,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697222820] [2022-02-20 14:34:36,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697222820] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:36,640 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:36,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 14:34:36,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981439114] [2022-02-20 14:34:36,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:36,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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:36,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:36,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:36,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:34:36,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:36,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:34:36,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:34:36,675 INFO L87 Difference]: Start difference. First operand 215 states and 307 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:38,167 INFO L93 Difference]: Finished difference Result 1079 states and 1536 transitions. [2022-02-20 14:34:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 14:34:38,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 371 transitions. [2022-02-20 14:34:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 371 transitions. [2022-02-20 14:34:38,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 371 transitions. [2022-02-20 14:34:38,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:38,420 INFO L225 Difference]: With dead ends: 1079 [2022-02-20 14:34:38,420 INFO L226 Difference]: Without dead ends: 883 [2022-02-20 14:34:38,421 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:38,422 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 375 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:38,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 669 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:34:38,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-02-20 14:34:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 211. [2022-02-20 14:34:38,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:38,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 883 states. Second operand has 211 states, 210 states have (on average 1.4428571428571428) internal successors, (303), 210 states have internal predecessors, (303), 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,451 INFO L74 IsIncluded]: Start isIncluded. First operand 883 states. Second operand has 211 states, 210 states have (on average 1.4428571428571428) internal successors, (303), 210 states have internal predecessors, (303), 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,451 INFO L87 Difference]: Start difference. First operand 883 states. Second operand has 211 states, 210 states have (on average 1.4428571428571428) internal successors, (303), 210 states have internal predecessors, (303), 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,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:38,502 INFO L93 Difference]: Finished difference Result 883 states and 1250 transitions. [2022-02-20 14:34:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1250 transitions. [2022-02-20 14:34:38,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:38,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:38,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 210 states have (on average 1.4428571428571428) internal successors, (303), 210 states have internal predecessors, (303), 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 883 states. [2022-02-20 14:34:38,504 INFO L87 Difference]: Start difference. First operand has 211 states, 210 states have (on average 1.4428571428571428) internal successors, (303), 210 states have internal predecessors, (303), 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 883 states. [2022-02-20 14:34:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:38,567 INFO L93 Difference]: Finished difference Result 883 states and 1250 transitions. [2022-02-20 14:34:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1250 transitions. [2022-02-20 14:34:38,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:38,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:38,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:38,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.4428571428571428) internal successors, (303), 210 states have internal predecessors, (303), 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,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 303 transitions. [2022-02-20 14:34:38,572 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 303 transitions. Word has length 67 [2022-02-20 14:34:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:38,572 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 303 transitions. [2022-02-20 14:34:38,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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,572 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 303 transitions. [2022-02-20 14:34:38,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 14:34:38,573 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:38,573 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:38,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 14:34:38,573 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:38,574 INFO L85 PathProgramCache]: Analyzing trace with hash 124562097, now seen corresponding path program 1 times [2022-02-20 14:34:38,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:38,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039510385] [2022-02-20 14:34:38,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:38,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:38,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {15157#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); {15157#true} is VALID [2022-02-20 14:34:38,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {15157#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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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; {15157#true} is VALID [2022-02-20 14:34:38,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {15157#true} assume !(0 == mp_add_~a3~0#1 % 256); {15157#true} is VALID [2022-02-20 14:34:38,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {15157#true} mp_add_~nb~0#1 := 4; {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(0 == mp_add_~b3~0#1 % 256); {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 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);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {15160#(and (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {15160#(and (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {15160#(and (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {15160#(and (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0)) (<= 4 |ULTIMATE.start_mp_add_~nb~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; {15160#(and (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {15160#(and (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(1 == mp_add_~i~0#1 % 256); {15160#(and (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {15160#(and (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(2 == mp_add_~i~0#1 % 256); {15160#(and (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {15160#(and (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(3 == mp_add_~i~0#1 % 256); {15160#(and (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {15160#(and (or (<= (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|) (+ |ULTIMATE.start_mp_add_~i~0#1| 4)) (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0)) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~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; {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(1 == mp_add_~i~0#1 % 256); {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(2 == mp_add_~i~0#1 % 256); {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(3 == mp_add_~i~0#1 % 256); {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(1 == mp_add_~i~0#1 % 256); {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(2 == mp_add_~i~0#1 % 256); {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(3 == mp_add_~i~0#1 % 256); {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 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);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(0 == mp_add_~i~0#1 % 256); {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:38,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {15159#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= 4 |ULTIMATE.start_mp_add_~nb~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_~a1~0#1 % 256; {15161#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= (+ |ULTIMATE.start_mp_add_~i~0#1| 3) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} is VALID [2022-02-20 14:34:38,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {15161#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= (+ |ULTIMATE.start_mp_add_~i~0#1| 3) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} assume !(2 == mp_add_~i~0#1 % 256); {15161#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= (+ |ULTIMATE.start_mp_add_~i~0#1| 3) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} is VALID [2022-02-20 14:34:38,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {15161#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= (+ |ULTIMATE.start_mp_add_~i~0#1| 3) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} assume !(3 == mp_add_~i~0#1 % 256); {15161#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= (+ |ULTIMATE.start_mp_add_~i~0#1| 3) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} is VALID [2022-02-20 14:34:38,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {15161#(and (<= (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 0) (<= (+ |ULTIMATE.start_mp_add_~i~0#1| 3) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)))} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {15158#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {15158#false} is VALID [2022-02-20 14:34:38,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {15158#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {15158#false} is VALID [2022-02-20 14:34:38,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {15158#false} assume !(2 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {15158#false} assume !(3 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {15158#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:38,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {15158#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; {15158#false} is VALID [2022-02-20 14:34:38,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {15158#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:38,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {15158#false} assume !(1 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {15158#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:38,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {15158#false} assume !(3 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {15158#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {15158#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {15158#false} is VALID [2022-02-20 14:34:38,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,756 INFO L290 TraceCheckUtils]: 45: Hoare triple {15158#false} assume !(1 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,756 INFO L290 TraceCheckUtils]: 46: Hoare triple {15158#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {15158#false} is VALID [2022-02-20 14:34:38,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {15158#false} assume !(3 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {15158#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:38,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {15158#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; {15158#false} is VALID [2022-02-20 14:34:38,757 INFO L290 TraceCheckUtils]: 50: Hoare triple {15158#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:38,757 INFO L290 TraceCheckUtils]: 51: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,757 INFO L290 TraceCheckUtils]: 52: Hoare triple {15158#false} assume !(1 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,757 INFO L290 TraceCheckUtils]: 53: Hoare triple {15158#false} assume !(2 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,757 INFO L290 TraceCheckUtils]: 54: Hoare triple {15158#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:38,757 INFO L290 TraceCheckUtils]: 55: Hoare triple {15158#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {15158#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {15158#false} is VALID [2022-02-20 14:34:38,758 INFO L290 TraceCheckUtils]: 57: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {15158#false} assume !(1 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {15158#false} assume !(2 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:38,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {15158#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; {15158#false} is VALID [2022-02-20 14:34:38,758 INFO L290 TraceCheckUtils]: 61: Hoare triple {15158#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:38,758 INFO L290 TraceCheckUtils]: 62: Hoare triple {15158#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); {15158#false} is VALID [2022-02-20 14:34:38,758 INFO L290 TraceCheckUtils]: 63: Hoare triple {15158#false} assume !(mp_add_~i~0#1 % 256 < 4); {15158#false} is VALID [2022-02-20 14:34:38,758 INFO L290 TraceCheckUtils]: 64: Hoare triple {15158#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; {15158#false} is VALID [2022-02-20 14:34:38,759 INFO L290 TraceCheckUtils]: 65: Hoare triple {15158#false} mp_add_#res#1 := mp_add_~r~0#1; {15158#false} is VALID [2022-02-20 14:34:38,759 INFO L290 TraceCheckUtils]: 66: Hoare triple {15158#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; {15158#false} is VALID [2022-02-20 14:34:38,759 INFO L290 TraceCheckUtils]: 67: Hoare triple {15158#false} assume 0 == __VERIFIER_assert_~cond#1; {15158#false} is VALID [2022-02-20 14:34:38,759 INFO L290 TraceCheckUtils]: 68: Hoare triple {15158#false} assume !false; {15158#false} is VALID [2022-02-20 14:34:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 14:34:38,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:38,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039510385] [2022-02-20 14:34:38,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039510385] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:34:38,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244492365] [2022-02-20 14:34:38,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:38,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:34:38,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:34:38,784 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:38,798 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:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:38,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:34:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:38,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:34:39,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {15157#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); {15157#true} is VALID [2022-02-20 14:34:39,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {15157#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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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; {15157#true} is VALID [2022-02-20 14:34:39,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {15157#true} assume !(0 == mp_add_~a3~0#1 % 256); {15157#true} is VALID [2022-02-20 14:34:39,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {15157#true} mp_add_~nb~0#1 := 4; {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,321 INFO L290 TraceCheckUtils]: 4: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} assume !(0 == mp_add_~b3~0#1 % 256); {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {15174#(= |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; {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~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; {15190#(and (= |ULTIMATE.start_mp_add_~nb~0#1| 4) (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 0))} is VALID [2022-02-20 14:34:39,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {15190#(and (= |ULTIMATE.start_mp_add_~nb~0#1| 4) (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 0))} assume !(1 == mp_add_~i~0#1 % 256); {15190#(and (= |ULTIMATE.start_mp_add_~nb~0#1| 4) (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 0))} is VALID [2022-02-20 14:34:39,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {15190#(and (= |ULTIMATE.start_mp_add_~nb~0#1| 4) (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 0))} assume !(2 == mp_add_~i~0#1 % 256); {15190#(and (= |ULTIMATE.start_mp_add_~nb~0#1| 4) (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 0))} is VALID [2022-02-20 14:34:39,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {15190#(and (= |ULTIMATE.start_mp_add_~nb~0#1| 4) (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 0))} assume !(3 == mp_add_~i~0#1 % 256); {15190#(and (= |ULTIMATE.start_mp_add_~nb~0#1| 4) (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 0))} is VALID [2022-02-20 14:34:39,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {15190#(and (= |ULTIMATE.start_mp_add_~nb~0#1| 4) (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 0))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~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; {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} assume !(1 == mp_add_~i~0#1 % 256); {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} assume !(2 == mp_add_~i~0#1 % 256); {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} assume !(3 == mp_add_~i~0#1 % 256); {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {15174#(= |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; {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} assume !(1 == mp_add_~i~0#1 % 256); {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} assume !(2 == mp_add_~i~0#1 % 256); {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} assume !(3 == mp_add_~i~0#1 % 256); {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {15174#(= |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; {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} assume !(0 == mp_add_~i~0#1 % 256); {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} is VALID [2022-02-20 14:34:39,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {15174#(= |ULTIMATE.start_mp_add_~nb~0#1| 4)} assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; {15245#(and (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:39,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {15245#(and (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(2 == mp_add_~i~0#1 % 256); {15245#(and (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:39,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {15245#(and (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(3 == mp_add_~i~0#1 % 256); {15245#(and (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {15245#(and (<= (mod |ULTIMATE.start_mp_add_~i~0#1| 256) 1) (= |ULTIMATE.start_mp_add_~nb~0#1| 4))} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {15158#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {15158#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {15158#false} assume !(2 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {15158#false} assume !(3 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {15158#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {15158#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; {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {15158#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {15158#false} assume !(1 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {15158#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {15158#false} assume !(3 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {15158#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {15158#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {15158#false} assume !(1 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {15158#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 47: Hoare triple {15158#false} assume !(3 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 48: Hoare triple {15158#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 49: Hoare triple {15158#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; {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 50: Hoare triple {15158#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 51: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 52: Hoare triple {15158#false} assume !(1 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {15158#false} assume !(2 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 54: Hoare triple {15158#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {15158#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {15158#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {15158#false} assume !(1 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 59: Hoare triple {15158#false} assume !(2 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 60: Hoare triple {15158#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; {15158#false} is VALID [2022-02-20 14:34:39,330 INFO L290 TraceCheckUtils]: 61: Hoare triple {15158#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:39,331 INFO L290 TraceCheckUtils]: 62: Hoare triple {15158#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); {15158#false} is VALID [2022-02-20 14:34:39,331 INFO L290 TraceCheckUtils]: 63: Hoare triple {15158#false} assume !(mp_add_~i~0#1 % 256 < 4); {15158#false} is VALID [2022-02-20 14:34:39,331 INFO L290 TraceCheckUtils]: 64: Hoare triple {15158#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; {15158#false} is VALID [2022-02-20 14:34:39,331 INFO L290 TraceCheckUtils]: 65: Hoare triple {15158#false} mp_add_#res#1 := mp_add_~r~0#1; {15158#false} is VALID [2022-02-20 14:34:39,331 INFO L290 TraceCheckUtils]: 66: Hoare triple {15158#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; {15158#false} is VALID [2022-02-20 14:34:39,331 INFO L290 TraceCheckUtils]: 67: Hoare triple {15158#false} assume 0 == __VERIFIER_assert_~cond#1; {15158#false} is VALID [2022-02-20 14:34:39,331 INFO L290 TraceCheckUtils]: 68: Hoare triple {15158#false} assume !false; {15158#false} is VALID [2022-02-20 14:34:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-20 14:34:39,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:34:40,338 INFO L290 TraceCheckUtils]: 68: Hoare triple {15158#false} assume !false; {15158#false} is VALID [2022-02-20 14:34:40,339 INFO L290 TraceCheckUtils]: 67: Hoare triple {15158#false} assume 0 == __VERIFIER_assert_~cond#1; {15158#false} is VALID [2022-02-20 14:34:40,339 INFO L290 TraceCheckUtils]: 66: Hoare triple {15158#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; {15158#false} is VALID [2022-02-20 14:34:40,339 INFO L290 TraceCheckUtils]: 65: Hoare triple {15158#false} mp_add_#res#1 := mp_add_~r~0#1; {15158#false} is VALID [2022-02-20 14:34:40,339 INFO L290 TraceCheckUtils]: 64: Hoare triple {15158#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; {15158#false} is VALID [2022-02-20 14:34:40,339 INFO L290 TraceCheckUtils]: 63: Hoare triple {15158#false} assume !(mp_add_~i~0#1 % 256 < 4); {15158#false} is VALID [2022-02-20 14:34:40,339 INFO L290 TraceCheckUtils]: 62: Hoare triple {15158#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); {15158#false} is VALID [2022-02-20 14:34:40,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {15158#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:40,339 INFO L290 TraceCheckUtils]: 60: Hoare triple {15158#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; {15158#false} is VALID [2022-02-20 14:34:40,339 INFO L290 TraceCheckUtils]: 59: Hoare triple {15158#false} assume !(2 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {15158#false} assume !(1 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,340 INFO L290 TraceCheckUtils]: 57: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,340 INFO L290 TraceCheckUtils]: 56: Hoare triple {15158#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {15158#false} is VALID [2022-02-20 14:34:40,340 INFO L290 TraceCheckUtils]: 55: Hoare triple {15158#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,340 INFO L290 TraceCheckUtils]: 54: Hoare triple {15158#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:40,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {15158#false} assume !(2 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,340 INFO L290 TraceCheckUtils]: 52: Hoare triple {15158#false} assume !(1 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {15158#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:40,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {15158#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; {15158#false} is VALID [2022-02-20 14:34:40,341 INFO L290 TraceCheckUtils]: 48: Hoare triple {15158#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:40,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {15158#false} assume !(3 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,341 INFO L290 TraceCheckUtils]: 46: Hoare triple {15158#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {15158#false} is VALID [2022-02-20 14:34:40,341 INFO L290 TraceCheckUtils]: 45: Hoare triple {15158#false} assume !(1 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,341 INFO L290 TraceCheckUtils]: 44: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,341 INFO L290 TraceCheckUtils]: 43: Hoare triple {15158#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {15158#false} is VALID [2022-02-20 14:34:40,341 INFO L290 TraceCheckUtils]: 42: Hoare triple {15158#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {15158#false} assume !(3 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,341 INFO L290 TraceCheckUtils]: 40: Hoare triple {15158#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:40,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {15158#false} assume !(1 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {15158#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:40,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {15158#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; {15158#false} is VALID [2022-02-20 14:34:40,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {15158#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {15158#false} is VALID [2022-02-20 14:34:40,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {15158#false} assume !(3 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {15158#false} assume !(2 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {15158#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {15158#false} is VALID [2022-02-20 14:34:40,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {15158#false} assume !(0 == mp_add_~i~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {15158#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {15158#false} is VALID [2022-02-20 14:34:40,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {15489#(< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256))} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {15158#false} is VALID [2022-02-20 14:34:40,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {15489#(< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256))} assume !(3 == mp_add_~i~0#1 % 256); {15489#(< (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:40,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {15489#(< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256))} assume !(2 == mp_add_~i~0#1 % 256); {15489#(< (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:40,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 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_~a1~0#1 % 256; {15489#(< (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:40,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} assume !(0 == mp_add_~i~0#1 % 256); {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~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; {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} assume !(3 == mp_add_~i~0#1 % 256); {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} assume !(2 == mp_add_~i~0#1 % 256); {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} assume !(1 == mp_add_~i~0#1 % 256); {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} assume !(3 == mp_add_~i~0#1 % 256); {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} assume !(2 == mp_add_~i~0#1 % 256); {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} assume !(1 == mp_add_~i~0#1 % 256); {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~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; {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {15542#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (not (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256))))} assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; {15499#(<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0)} is VALID [2022-02-20 14:34:40,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {15542#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (not (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256))))} assume !(3 == mp_add_~i~0#1 % 256); {15542#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (not (< (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:40,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {15542#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (not (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256))))} assume !(2 == mp_add_~i~0#1 % 256); {15542#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (not (< (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:40,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {15542#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (not (< (mod |ULTIMATE.start_mp_add_~i~0#1| 256) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256))))} assume !(1 == mp_add_~i~0#1 % 256); {15542#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (not (< (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:40,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {15555#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~nb~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; {15542#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (not (< (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:40,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {15555#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~nb~0#1| 256) 0))} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {15555#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~nb~0#1| 256) 0))} is VALID [2022-02-20 14:34:40,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {15555#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~nb~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; {15555#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~nb~0#1| 256) 0))} is VALID [2022-02-20 14:34:40,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {15555#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~nb~0#1| 256) 0))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {15555#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~nb~0#1| 256) 0))} is VALID [2022-02-20 14:34:40,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {15555#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~nb~0#1| 256) 0))} assume !(0 == mp_add_~b3~0#1 % 256); {15555#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~nb~0#1| 256) 0))} is VALID [2022-02-20 14:34:40,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {15157#true} mp_add_~nb~0#1 := 4; {15555#(or (<= (div (+ (- 2) (mod |ULTIMATE.start_mp_add_~nb~0#1| 256)) (- 256)) 0) (<= (mod |ULTIMATE.start_mp_add_~nb~0#1| 256) 0))} is VALID [2022-02-20 14:34:40,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {15157#true} assume !(0 == mp_add_~a3~0#1 % 256); {15157#true} is VALID [2022-02-20 14:34:40,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {15157#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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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; {15157#true} is VALID [2022-02-20 14:34:40,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {15157#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); {15157#true} is VALID [2022-02-20 14:34:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 14:34:40,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244492365] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:34:40,354 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:34:40,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-02-20 14:34:40,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044441305] [2022-02-20 14:34:40,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:34:40,355 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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:40,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:40,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:40,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:34:40,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:34:40,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:34:40,429 INFO L87 Difference]: Start difference. First operand 211 states and 303 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:41,608 INFO L93 Difference]: Finished difference Result 1163 states and 1662 transitions. [2022-02-20 14:34:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 14:34:41,608 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 399 transitions. [2022-02-20 14:34:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 399 transitions. [2022-02-20 14:34:41,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 399 transitions. [2022-02-20 14:34:41,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 399 edges. 399 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:41,960 INFO L225 Difference]: With dead ends: 1163 [2022-02-20 14:34:41,960 INFO L226 Difference]: Without dead ends: 954 [2022-02-20 14:34:41,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:34:41,961 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 527 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:41,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 349 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:34:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2022-02-20 14:34:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 717. [2022-02-20 14:34:42,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:42,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 954 states. Second operand has 717 states, 716 states have (on average 1.437150837988827) internal successors, (1029), 716 states have internal predecessors, (1029), 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,088 INFO L74 IsIncluded]: Start isIncluded. First operand 954 states. Second operand has 717 states, 716 states have (on average 1.437150837988827) internal successors, (1029), 716 states have internal predecessors, (1029), 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,088 INFO L87 Difference]: Start difference. First operand 954 states. Second operand has 717 states, 716 states have (on average 1.437150837988827) internal successors, (1029), 716 states have internal predecessors, (1029), 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,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:42,117 INFO L93 Difference]: Finished difference Result 954 states and 1343 transitions. [2022-02-20 14:34:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1343 transitions. [2022-02-20 14:34:42,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:42,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:42,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 717 states, 716 states have (on average 1.437150837988827) internal successors, (1029), 716 states have internal predecessors, (1029), 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 954 states. [2022-02-20 14:34:42,119 INFO L87 Difference]: Start difference. First operand has 717 states, 716 states have (on average 1.437150837988827) internal successors, (1029), 716 states have internal predecessors, (1029), 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 954 states. [2022-02-20 14:34:42,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:42,147 INFO L93 Difference]: Finished difference Result 954 states and 1343 transitions. [2022-02-20 14:34:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1343 transitions. [2022-02-20 14:34:42,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:42,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:42,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:42,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 1.437150837988827) internal successors, (1029), 716 states have internal predecessors, (1029), 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,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1029 transitions. [2022-02-20 14:34:42,164 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1029 transitions. Word has length 69 [2022-02-20 14:34:42,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:42,164 INFO L470 AbstractCegarLoop]: Abstraction has 717 states and 1029 transitions. [2022-02-20 14:34:42,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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,165 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1029 transitions. [2022-02-20 14:34:42,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 14:34:42,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:42,166 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:42,185 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:42,383 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,SelfDestructingSolverStorable12 [2022-02-20 14:34:42,383 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:42,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:42,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1027009864, now seen corresponding path program 1 times [2022-02-20 14:34:42,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:42,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223659978] [2022-02-20 14:34:42,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:42,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:42,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {19424#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); {19424#true} is VALID [2022-02-20 14:34:42,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {19424#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_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~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; {19424#true} is VALID [2022-02-20 14:34:42,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {19424#true} assume !(0 == mp_add_~a3~0#1 % 256); {19424#true} is VALID [2022-02-20 14:34:42,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {19424#true} mp_add_~nb~0#1 := 4; {19426#(and (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4))} is VALID [2022-02-20 14:34:42,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {19426#(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;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; {19427#(<= 3 (+ |ULTIMATE.start_mp_add_~nb~0#1| (* (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256) 256)))} is VALID [2022-02-20 14:34:42,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {19427#(<= 3 (+ |ULTIMATE.start_mp_add_~nb~0#1| (* (div (+ 3 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256) 256)))} assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; {19428#(<= 2 (+ (* 256 (div (+ 2 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256)) |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:42,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {19428#(<= 2 (+ (* 256 (div (+ 2 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256)) |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(0 == mp_add_~b1~0#1 % 256); {19428#(<= 2 (+ (* 256 (div (+ 2 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256)) |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:42,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {19428#(<= 2 (+ (* 256 (div (+ 2 (* (- 1) |ULTIMATE.start_mp_add_~nb~0#1|)) 256)) |ULTIMATE.start_mp_add_~nb~0#1|))} mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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; {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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; {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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_~a0~0#1 % 256; {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(1 == mp_add_~i~0#1 % 256); {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(2 == mp_add_~i~0#1 % 256); {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(3 == mp_add_~i~0#1 % 256); {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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; {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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; {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(1 == mp_add_~i~0#1 % 256); {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(2 == mp_add_~i~0#1 % 256); {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(3 == mp_add_~i~0#1 % 256); {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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; {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(1 == mp_add_~i~0#1 % 256); {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(2 == mp_add_~i~0#1 % 256); {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} assume !(3 == mp_add_~i~0#1 % 256); {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|)) (= |ULTIMATE.start_mp_add_~i~0#1| 0))} is VALID [2022-02-20 14:34:42,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {19429#(and (<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |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; {19430#(<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) |ULTIMATE.start_mp_add_~nb~0#1|)} is VALID [2022-02-20 14:34:42,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {19430#(<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) |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);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; {19430#(<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) |ULTIMATE.start_mp_add_~nb~0#1|)} is VALID [2022-02-20 14:34:42,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {19430#(<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) |ULTIMATE.start_mp_add_~nb~0#1|)} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {19430#(<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) |ULTIMATE.start_mp_add_~nb~0#1|)} is VALID [2022-02-20 14:34:42,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {19430#(<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) |ULTIMATE.start_mp_add_~nb~0#1|)} assume !(0 == mp_add_~i~0#1 % 256); {19430#(<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) |ULTIMATE.start_mp_add_~nb~0#1|)} is VALID [2022-02-20 14:34:42,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {19430#(<= (+ 2 (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256)) |ULTIMATE.start_mp_add_~nb~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_~a1~0#1 % 256; {19431#(<= (+ |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:42,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {19431#(<= (+ |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(2 == mp_add_~i~0#1 % 256); {19431#(<= (+ |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:42,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {19431#(<= (+ |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(3 == mp_add_~i~0#1 % 256); {19431#(<= (+ |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|))} is VALID [2022-02-20 14:34:42,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {19431#(<= (+ |ULTIMATE.start_mp_add_~i~0#1| (* (div |ULTIMATE.start_mp_add_~nb~0#1| 256) 256) 1) (+ (* (div |ULTIMATE.start_mp_add_~i~0#1| 256) 256) |ULTIMATE.start_mp_add_~nb~0#1|))} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {19425#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {19425#false} is VALID [2022-02-20 14:34:42,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {19425#false} assume !(0 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {19425#false} assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; {19425#false} is VALID [2022-02-20 14:34:42,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {19425#false} assume !(2 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {19425#false} assume !(3 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {19425#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {19425#false} is VALID [2022-02-20 14:34:42,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {19425#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; {19425#false} is VALID [2022-02-20 14:34:42,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {19425#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {19425#false} is VALID [2022-02-20 14:34:42,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {19425#false} assume !(0 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {19425#false} assume !(1 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {19425#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; {19425#false} is VALID [2022-02-20 14:34:42,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {19425#false} assume !(3 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {19425#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {19425#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {19425#false} is VALID [2022-02-20 14:34:42,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {19425#false} assume !(0 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,549 INFO L290 TraceCheckUtils]: 47: Hoare triple {19425#false} assume !(1 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,549 INFO L290 TraceCheckUtils]: 48: Hoare triple {19425#false} assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; {19425#false} is VALID [2022-02-20 14:34:42,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {19425#false} assume !(3 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,549 INFO L290 TraceCheckUtils]: 50: Hoare triple {19425#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {19425#false} is VALID [2022-02-20 14:34:42,549 INFO L290 TraceCheckUtils]: 51: Hoare triple {19425#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; {19425#false} is VALID [2022-02-20 14:34:42,549 INFO L290 TraceCheckUtils]: 52: Hoare triple {19425#false} assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; {19425#false} is VALID [2022-02-20 14:34:42,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {19425#false} assume !(0 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,550 INFO L290 TraceCheckUtils]: 54: Hoare triple {19425#false} assume !(1 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,550 INFO L290 TraceCheckUtils]: 55: Hoare triple {19425#false} assume !(2 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {19425#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; {19425#false} is VALID [2022-02-20 14:34:42,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {19425#false} assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,550 INFO L290 TraceCheckUtils]: 58: Hoare triple {19425#false} assume !(mp_add_~partial_sum~0#1 % 65536 > 255); {19425#false} is VALID [2022-02-20 14:34:42,550 INFO L290 TraceCheckUtils]: 59: Hoare triple {19425#false} assume !(0 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,550 INFO L290 TraceCheckUtils]: 60: Hoare triple {19425#false} assume !(1 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,550 INFO L290 TraceCheckUtils]: 61: Hoare triple {19425#false} assume !(2 == mp_add_~i~0#1 % 256); {19425#false} is VALID [2022-02-20 14:34:42,550 INFO L290 TraceCheckUtils]: 62: Hoare triple {19425#false} assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; {19425#false} is VALID [2022-02-20 14:34:42,551 INFO L290 TraceCheckUtils]: 63: Hoare triple {19425#false} mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; {19425#false} is VALID [2022-02-20 14:34:42,551 INFO L290 TraceCheckUtils]: 64: Hoare triple {19425#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); {19425#false} is VALID [2022-02-20 14:34:42,551 INFO L290 TraceCheckUtils]: 65: Hoare triple {19425#false} assume !(mp_add_~i~0#1 % 256 < 4); {19425#false} is VALID [2022-02-20 14:34:42,551 INFO L290 TraceCheckUtils]: 66: Hoare triple {19425#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; {19425#false} is VALID [2022-02-20 14:34:42,551 INFO L290 TraceCheckUtils]: 67: Hoare triple {19425#false} mp_add_#res#1 := mp_add_~r~0#1; {19425#false} is VALID [2022-02-20 14:34:42,551 INFO L290 TraceCheckUtils]: 68: Hoare triple {19425#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; {19425#false} is VALID [2022-02-20 14:34:42,551 INFO L290 TraceCheckUtils]: 69: Hoare triple {19425#false} assume 0 == __VERIFIER_assert_~cond#1; {19425#false} is VALID [2022-02-20 14:34:42,551 INFO L290 TraceCheckUtils]: 70: Hoare triple {19425#false} assume !false; {19425#false} is VALID [2022-02-20 14:34:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 14:34:42,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:42,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223659978] [2022-02-20 14:34:42,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223659978] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:34:42,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777263941] [2022-02-20 14:34:42,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:42,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:34:42,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:34:42,554 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:42,555 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:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:42,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 14:34:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:42,684 INFO L286 TraceCheckSpWp]: Computing forward predicates...