./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 09:32:26,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 09:32:26,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 09:32:26,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 09:32:26,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 09:32:26,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 09:32:26,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 09:32:26,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 09:32:26,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 09:32:26,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 09:32:26,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 09:32:26,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 09:32:26,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 09:32:26,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 09:32:26,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 09:32:26,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 09:32:26,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 09:32:26,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 09:32:26,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 09:32:26,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 09:32:26,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 09:32:26,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 09:32:26,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 09:32:26,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 09:32:26,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 09:32:26,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 09:32:26,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 09:32:26,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 09:32:26,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 09:32:26,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 09:32:26,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 09:32:26,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 09:32:26,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 09:32:26,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 09:32:26,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 09:32:26,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 09:32:26,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 09:32:26,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 09:32:26,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 09:32:26,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 09:32:26,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 09:32:26,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-16 09:32:26,477 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 09:32:26,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 09:32:26,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 09:32:26,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 09:32:26,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 09:32:26,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 09:32:26,480 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 09:32:26,480 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 09:32:26,480 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 09:32:26,480 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 09:32:26,481 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 09:32:26,481 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 09:32:26,481 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 09:32:26,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 09:32:26,482 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 09:32:26,482 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 09:32:26,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 09:32:26,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 09:32:26,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 09:32:26,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 09:32:26,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 09:32:26,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 09:32:26,483 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 09:32:26,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 09:32:26,484 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 09:32:26,484 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 09:32:26,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 09:32:26,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 09:32:26,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 09:32:26,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 09:32:26,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 09:32:26,485 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 09:32:26,486 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 09:32:26,486 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 [2021-12-16 09:32:26,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 09:32:26,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 09:32:26,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 09:32:26,699 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 09:32:26,699 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 09:32:26,700 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 [2021-12-16 09:32:26,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59864789/eb4f09c4943a4b389b8bd460975692da/FLAG7fd57f257 [2021-12-16 09:32:27,040 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 09:32:27,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-12-16 09:32:27,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59864789/eb4f09c4943a4b389b8bd460975692da/FLAG7fd57f257 [2021-12-16 09:32:27,478 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59864789/eb4f09c4943a4b389b8bd460975692da [2021-12-16 09:32:27,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 09:32:27,483 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 09:32:27,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 09:32:27,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 09:32:27,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 09:32:27,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:32:27" (1/1) ... [2021-12-16 09:32:27,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17504820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:27, skipping insertion in model container [2021-12-16 09:32:27,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:32:27" (1/1) ... [2021-12-16 09:32:27,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 09:32:27,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 09:32:27,669 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] [2021-12-16 09:32:27,709 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:32:27,717 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 09:32:27,729 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] [2021-12-16 09:32:27,753 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:32:27,773 INFO L208 MainTranslator]: Completed translation [2021-12-16 09:32:27,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:27 WrapperNode [2021-12-16 09:32:27,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 09:32:27,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 09:32:27,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 09:32:27,775 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 09:32:27,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:27" (1/1) ... [2021-12-16 09:32:27,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:27" (1/1) ... [2021-12-16 09:32:27,813 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-16 09:32:27,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 09:32:27,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 09:32:27,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 09:32:27,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 09:32:27,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:27" (1/1) ... [2021-12-16 09:32:27,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:27" (1/1) ... [2021-12-16 09:32:27,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:27" (1/1) ... [2021-12-16 09:32:27,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:27" (1/1) ... [2021-12-16 09:32:27,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:27" (1/1) ... [2021-12-16 09:32:27,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:27" (1/1) ... [2021-12-16 09:32:27,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:27" (1/1) ... [2021-12-16 09:32:27,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 09:32:27,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 09:32:27,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 09:32:27,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 09:32:27,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:27" (1/1) ... [2021-12-16 09:32:27,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:27,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:27,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:27,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-16 09:32:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 09:32:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 09:32:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 09:32:27,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 09:32:27,981 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 09:32:27,982 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 09:32:28,156 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 09:32:28,161 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 09:32:28,161 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-16 09:32:28,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:32:28 BoogieIcfgContainer [2021-12-16 09:32:28,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 09:32:28,163 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 09:32:28,183 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 09:32:28,187 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 09:32:28,188 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:32:28,188 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 09:32:27" (1/3) ... [2021-12-16 09:32:28,189 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64ec72d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:32:28, skipping insertion in model container [2021-12-16 09:32:28,189 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:32:28,189 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:27" (2/3) ... [2021-12-16 09:32:28,189 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64ec72d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:32:28, skipping insertion in model container [2021-12-16 09:32:28,189 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:32:28,190 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:32:28" (3/3) ... [2021-12-16 09:32:28,191 INFO L388 chiAutomizerObserver]: Analyzing ICFG byte_add_1-1.i [2021-12-16 09:32:28,224 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 09:32:28,225 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 09:32:28,225 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 09:32:28,225 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 09:32:28,225 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 09:32:28,225 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 09:32:28,225 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 09:32:28,225 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 09:32:28,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:28,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-12-16 09:32:28,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:28,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:28,258 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:32:28,259 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:28,259 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 09:32:28,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:28,264 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-12-16 09:32:28,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:28,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:28,265 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:32:28,265 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:28,269 INFO L791 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue 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); 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 5#L59true assume !(0 == mp_add_~a3~0#1 % 256); 16#L59-1true mp_add_~nb~0#1 := 4; 18#L69true assume !(0 == mp_add_~b3~0#1 % 256); 36#L69-1true mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 23#L80-2true [2021-12-16 09:32:28,270 INFO L793 eck$LassoCheckResult]: Loop: 23#L80-2true 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; 33#L83true assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 42#L83-1true assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8#L89true assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 40#L95-1true assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 17#L99-1true assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 12#L100-1true assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 28#L101-1true assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 31#L102-1true mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23#L80-2true [2021-12-16 09:32:28,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:28,275 INFO L85 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2021-12-16 09:32:28,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:28,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848981259] [2021-12-16 09:32:28,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:28,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:28,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:28,450 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 318197182, now seen corresponding path program 1 times [2021-12-16 09:32:28,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:28,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913457702] [2021-12-16 09:32:28,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:28,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:28,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:28,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913457702] [2021-12-16 09:32:28,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913457702] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:28,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:28,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:28,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049809507] [2021-12-16 09:32:28,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:28,543 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:28,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:28,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:32:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:32:28,578 INFO L87 Difference]: Start difference. First operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 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 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:28,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:28,726 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2021-12-16 09:32:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:32:28,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 94 transitions. [2021-12-16 09:32:28,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2021-12-16 09:32:28,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 56 states and 86 transitions. [2021-12-16 09:32:28,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-12-16 09:32:28,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-12-16 09:32:28,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 86 transitions. [2021-12-16 09:32:28,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:28,747 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 86 transitions. [2021-12-16 09:32:28,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 86 transitions. [2021-12-16 09:32:28,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2021-12-16 09:32:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 53 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 84 transitions. [2021-12-16 09:32:28,766 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-12-16 09:32:28,766 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-12-16 09:32:28,766 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 09:32:28,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 84 transitions. [2021-12-16 09:32:28,767 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-16 09:32:28,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:28,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:28,768 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:28,768 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:28,768 INFO L791 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY 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); 127#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 114#L59 assume !(0 == mp_add_~a3~0#1 % 256); 115#L59-1 mp_add_~nb~0#1 := 4; 132#L69 assume !(0 == mp_add_~b3~0#1 % 256); 123#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 138#L80-2 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; 139#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 129#L83-1 [2021-12-16 09:32:28,769 INFO L793 eck$LassoCheckResult]: Loop: 129#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 118#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 119#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 133#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 125#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 126#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 144#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 147#L80-2 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; 159#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 160#L84 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; 135#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 141#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 128#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 129#L83-1 [2021-12-16 09:32:28,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2021-12-16 09:32:28,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:28,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298390182] [2021-12-16 09:32:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:28,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:28,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:28,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298390182] [2021-12-16 09:32:28,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298390182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:28,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:28,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:28,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74709575] [2021-12-16 09:32:28,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:28,883 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:28,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 1 times [2021-12-16 09:32:28,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:28,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981163767] [2021-12-16 09:32:28,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:28,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:28,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:28,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981163767] [2021-12-16 09:32:28,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981163767] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:28,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:28,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:28,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364386632] [2021-12-16 09:32:28,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:28,942 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:28,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:28,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:32:28,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:32:28,943 INFO L87 Difference]: Start difference. First operand 54 states and 84 transitions. cyclomatic complexity: 32 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:29,165 INFO L93 Difference]: Finished difference Result 149 states and 228 transitions. [2021-12-16 09:32:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:32:29,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 228 transitions. [2021-12-16 09:32:29,168 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2021-12-16 09:32:29,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 228 transitions. [2021-12-16 09:32:29,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2021-12-16 09:32:29,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2021-12-16 09:32:29,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 228 transitions. [2021-12-16 09:32:29,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:29,171 INFO L681 BuchiCegarLoop]: Abstraction has 149 states and 228 transitions. [2021-12-16 09:32:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 228 transitions. [2021-12-16 09:32:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 78. [2021-12-16 09:32:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2021-12-16 09:32:29,176 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-12-16 09:32:29,176 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-12-16 09:32:29,176 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 09:32:29,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 113 transitions. [2021-12-16 09:32:29,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-16 09:32:29,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:29,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:29,178 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:29,178 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:29,178 INFO L791 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY 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); 343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 333#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 335#L61 assume !(0 == mp_add_~a2~0#1 % 256); 336#L59-1 mp_add_~nb~0#1 := 4; 350#L69 assume !(0 == mp_add_~b3~0#1 % 256); 341#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 380#L80-2 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; 381#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 402#L83-1 [2021-12-16 09:32:29,178 INFO L793 eck$LassoCheckResult]: Loop: 402#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 404#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 372#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 373#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 403#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 362#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 363#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 364#L80-2 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; 378#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 368#L84 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; 352#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 357#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 358#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 402#L83-1 [2021-12-16 09:32:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash -384676570, now seen corresponding path program 1 times [2021-12-16 09:32:29,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:29,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968766098] [2021-12-16 09:32:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:29,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:29,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:29,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968766098] [2021-12-16 09:32:29,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968766098] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:29,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:29,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:29,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404224881] [2021-12-16 09:32:29,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:29,215 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:29,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 2 times [2021-12-16 09:32:29,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:29,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825493233] [2021-12-16 09:32:29,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:29,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:29,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:29,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:29,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825493233] [2021-12-16 09:32:29,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825493233] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:29,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:29,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:29,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863825092] [2021-12-16 09:32:29,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:29,255 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:29,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:29,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:32:29,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:32:29,257 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. cyclomatic complexity: 37 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:29,261 INFO L93 Difference]: Finished difference Result 66 states and 93 transitions. [2021-12-16 09:32:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:32:29,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 93 transitions. [2021-12-16 09:32:29,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-16 09:32:29,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 93 transitions. [2021-12-16 09:32:29,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2021-12-16 09:32:29,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2021-12-16 09:32:29,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 93 transitions. [2021-12-16 09:32:29,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:29,265 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 93 transitions. [2021-12-16 09:32:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 93 transitions. [2021-12-16 09:32:29,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-12-16 09:32:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2021-12-16 09:32:29,268 INFO L704 BuchiCegarLoop]: Abstraction has 66 states and 93 transitions. [2021-12-16 09:32:29,268 INFO L587 BuchiCegarLoop]: Abstraction has 66 states and 93 transitions. [2021-12-16 09:32:29,268 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 09:32:29,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 93 transitions. [2021-12-16 09:32:29,269 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-16 09:32:29,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:29,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:29,269 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:29,269 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:29,269 INFO L791 eck$LassoCheckResult]: Stem: 502#ULTIMATE.startENTRY 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); 492#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 481#L59 assume !(0 == mp_add_~a3~0#1 % 256); 482#L59-1 mp_add_~nb~0#1 := 4; 497#L69 assume !(0 == mp_add_~b3~0#1 % 256); 488#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 514#L80-2 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; 543#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 542#L84 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; 541#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 539#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 537#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 535#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 532#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 484#L95-1 [2021-12-16 09:32:29,269 INFO L793 eck$LassoCheckResult]: Loop: 484#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 525#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 523#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 522#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 520#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 517#L80-2 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; 518#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 530#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 531#L90 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; 511#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 485#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 486#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 483#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 484#L95-1 [2021-12-16 09:32:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1874592092, now seen corresponding path program 1 times [2021-12-16 09:32:29,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:29,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633942383] [2021-12-16 09:32:29,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:29,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:29,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:29,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633942383] [2021-12-16 09:32:29,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633942383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:29,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:29,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:29,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278021641] [2021-12-16 09:32:29,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:29,351 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:29,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:29,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1213684438, now seen corresponding path program 1 times [2021-12-16 09:32:29,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:29,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458730667] [2021-12-16 09:32:29,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:29,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:29,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:29,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458730667] [2021-12-16 09:32:29,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458730667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:29,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:29,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:29,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234112345] [2021-12-16 09:32:29,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:29,406 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:29,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:29,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:32:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:32:29,407 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. cyclomatic complexity: 29 Second operand has 4 states, 4 states have (on average 3.25) 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) [2021-12-16 09:32:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:29,545 INFO L93 Difference]: Finished difference Result 91 states and 134 transitions. [2021-12-16 09:32:29,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:32:29,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 134 transitions. [2021-12-16 09:32:29,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2021-12-16 09:32:29,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 134 transitions. [2021-12-16 09:32:29,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2021-12-16 09:32:29,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2021-12-16 09:32:29,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 134 transitions. [2021-12-16 09:32:29,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:29,549 INFO L681 BuchiCegarLoop]: Abstraction has 91 states and 134 transitions. [2021-12-16 09:32:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 134 transitions. [2021-12-16 09:32:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2021-12-16 09:32:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 82 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2021-12-16 09:32:29,553 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 120 transitions. [2021-12-16 09:32:29,553 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 120 transitions. [2021-12-16 09:32:29,554 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 09:32:29,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 120 transitions. [2021-12-16 09:32:29,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2021-12-16 09:32:29,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:29,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:29,555 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:29,555 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:29,555 INFO L791 eck$LassoCheckResult]: Stem: 667#ULTIMATE.startENTRY 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); 658#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 650#L59 assume !(0 == mp_add_~a3~0#1 % 256); 651#L59-1 mp_add_~nb~0#1 := 4; 663#L69 assume !(0 == mp_add_~b3~0#1 % 256); 656#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 684#L80-2 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; 712#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 711#L84 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; 710#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 708#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 705#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 701#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 698#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 649#L95-1 [2021-12-16 09:32:29,556 INFO L793 eck$LassoCheckResult]: Loop: 649#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 709#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 706#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 703#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 699#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 689#L80-2 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; 690#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 724#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 725#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 687#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 664#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 653#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 654#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 676#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 691#L80-2 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; 696#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 720#L84 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; 685#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 671#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 659#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 660#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 648#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 649#L95-1 [2021-12-16 09:32:29,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:29,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1874592092, now seen corresponding path program 2 times [2021-12-16 09:32:29,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:29,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060829756] [2021-12-16 09:32:29,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:29,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:29,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:29,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060829756] [2021-12-16 09:32:29,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060829756] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:29,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:29,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:29,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731409956] [2021-12-16 09:32:29,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:29,621 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:29,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:29,621 INFO L85 PathProgramCache]: Analyzing trace with hash 857385497, now seen corresponding path program 1 times [2021-12-16 09:32:29,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:29,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420577713] [2021-12-16 09:32:29,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:29,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 09:32:29,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:29,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420577713] [2021-12-16 09:32:29,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420577713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:29,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:29,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:29,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503120280] [2021-12-16 09:32:29,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:29,636 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:29,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:29,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:32:29,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:32:29,637 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:29,761 INFO L93 Difference]: Finished difference Result 164 states and 234 transitions. [2021-12-16 09:32:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:32:29,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 234 transitions. [2021-12-16 09:32:29,763 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2021-12-16 09:32:29,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 164 states and 234 transitions. [2021-12-16 09:32:29,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2021-12-16 09:32:29,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2021-12-16 09:32:29,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 234 transitions. [2021-12-16 09:32:29,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:29,765 INFO L681 BuchiCegarLoop]: Abstraction has 164 states and 234 transitions. [2021-12-16 09:32:29,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 234 transitions. [2021-12-16 09:32:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 91. [2021-12-16 09:32:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2021-12-16 09:32:29,768 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2021-12-16 09:32:29,769 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2021-12-16 09:32:29,769 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 09:32:29,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 128 transitions. [2021-12-16 09:32:29,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2021-12-16 09:32:29,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:29,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:29,770 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:29,770 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:29,770 INFO L791 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY 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); 917#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 910#L59 assume !(0 == mp_add_~a3~0#1 % 256); 911#L59-1 mp_add_~nb~0#1 := 4; 922#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 914#L71 assume !(0 == mp_add_~b2~0#1 % 256); 915#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 969#L80-2 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; 968#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 967#L84 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; 966#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 965#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 964#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 962#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 960#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 909#L95-1 [2021-12-16 09:32:29,770 INFO L793 eck$LassoCheckResult]: Loop: 909#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 923#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 912#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 913#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 935#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 944#L80-2 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; 945#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 919#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 905#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 958#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 956#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 954#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 952#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 951#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 949#L80-2 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; 950#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 981#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 982#L90 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; 938#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 906#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 907#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 908#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 909#L95-1 [2021-12-16 09:32:29,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:29,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2095675795, now seen corresponding path program 1 times [2021-12-16 09:32:29,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:29,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862656335] [2021-12-16 09:32:29,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:29,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:29,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:29,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862656335] [2021-12-16 09:32:29,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862656335] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:29,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:29,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 09:32:29,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469372680] [2021-12-16 09:32:29,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:29,833 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:29,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1043280079, now seen corresponding path program 1 times [2021-12-16 09:32:29,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:29,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310007077] [2021-12-16 09:32:29,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:29,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 09:32:29,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:29,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310007077] [2021-12-16 09:32:29,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310007077] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:29,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:29,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:29,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308856645] [2021-12-16 09:32:29,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:29,848 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:29,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:29,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:32:29,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:32:29,849 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. cyclomatic complexity: 39 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:30,064 INFO L93 Difference]: Finished difference Result 245 states and 348 transitions. [2021-12-16 09:32:30,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:32:30,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 348 transitions. [2021-12-16 09:32:30,066 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2021-12-16 09:32:30,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 245 states and 348 transitions. [2021-12-16 09:32:30,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2021-12-16 09:32:30,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2021-12-16 09:32:30,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 348 transitions. [2021-12-16 09:32:30,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:30,068 INFO L681 BuchiCegarLoop]: Abstraction has 245 states and 348 transitions. [2021-12-16 09:32:30,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 348 transitions. [2021-12-16 09:32:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 91. [2021-12-16 09:32:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2021-12-16 09:32:30,071 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2021-12-16 09:32:30,071 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2021-12-16 09:32:30,071 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-16 09:32:30,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 128 transitions. [2021-12-16 09:32:30,072 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2021-12-16 09:32:30,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:30,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:30,072 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,072 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,073 INFO L791 eck$LassoCheckResult]: Stem: 1274#ULTIMATE.startENTRY 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); 1264#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 1257#L59 assume !(0 == mp_add_~a3~0#1 % 256); 1258#L59-1 mp_add_~nb~0#1 := 4; 1269#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 1261#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 1263#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 1289#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1316#L80-2 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; 1315#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1314#L84 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; 1313#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1312#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1311#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1309#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1307#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1256#L95-1 [2021-12-16 09:32:30,073 INFO L793 eck$LassoCheckResult]: Loop: 1256#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1270#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1259#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1260#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1298#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1291#L80-2 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; 1292#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1266#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1337#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1305#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1303#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 1301#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 1300#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 1299#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1296#L80-2 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; 1297#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1328#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 1329#L90 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; 1284#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 1253#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 1254#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 1255#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1256#L95-1 [2021-12-16 09:32:30,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:30,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1829134745, now seen corresponding path program 1 times [2021-12-16 09:32:30,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:30,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762145638] [2021-12-16 09:32:30,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:30,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:30,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:30,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762145638] [2021-12-16 09:32:30,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762145638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:30,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:30,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:30,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897420870] [2021-12-16 09:32:30,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:30,131 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1043280079, now seen corresponding path program 2 times [2021-12-16 09:32:30,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:30,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3888418] [2021-12-16 09:32:30,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:30,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 09:32:30,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:30,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3888418] [2021-12-16 09:32:30,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3888418] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:30,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:30,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:30,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872099871] [2021-12-16 09:32:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:30,145 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:30,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:30,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:32:30,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:32:30,146 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. cyclomatic complexity: 39 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:30,208 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2021-12-16 09:32:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 09:32:30,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 318 transitions. [2021-12-16 09:32:30,210 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 177 [2021-12-16 09:32:30,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 219 states and 318 transitions. [2021-12-16 09:32:30,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2021-12-16 09:32:30,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2021-12-16 09:32:30,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 318 transitions. [2021-12-16 09:32:30,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:30,212 INFO L681 BuchiCegarLoop]: Abstraction has 219 states and 318 transitions. [2021-12-16 09:32:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 318 transitions. [2021-12-16 09:32:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 149. [2021-12-16 09:32:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 1.5033557046979866) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2021-12-16 09:32:30,223 INFO L704 BuchiCegarLoop]: Abstraction has 149 states and 224 transitions. [2021-12-16 09:32:30,223 INFO L587 BuchiCegarLoop]: Abstraction has 149 states and 224 transitions. [2021-12-16 09:32:30,223 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-16 09:32:30,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 224 transitions. [2021-12-16 09:32:30,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 113 [2021-12-16 09:32:30,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:30,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:30,224 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,224 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,225 INFO L791 eck$LassoCheckResult]: Stem: 1599#ULTIMATE.startENTRY 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); 1589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 1578#L59 assume !(0 == mp_add_~a3~0#1 % 256); 1579#L59-1 mp_add_~nb~0#1 := 4; 1594#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1587#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1722#L80-2 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; 1723#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1596#L84 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; 1597#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1602#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1603#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1697#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 1691#L90 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; 1685#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 1682#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 1678#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 1641#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1642#L95-1 [2021-12-16 09:32:30,225 INFO L793 eck$LassoCheckResult]: Loop: 1642#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1680#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1715#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1706#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1703#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1700#L80-2 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; 1695#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1690#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1684#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1681#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1677#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 1676#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 1675#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 1673#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1670#L80-2 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; 1667#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1668#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 1687#L90 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; 1654#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 1650#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 1645#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 1643#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1642#L95-1 [2021-12-16 09:32:30,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:30,225 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 1 times [2021-12-16 09:32:30,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:30,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981352042] [2021-12-16 09:32:30,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:30,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:30,234 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:30,249 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:30,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1043280079, now seen corresponding path program 3 times [2021-12-16 09:32:30,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:30,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430399108] [2021-12-16 09:32:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:30,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 09:32:30,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:30,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430399108] [2021-12-16 09:32:30,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430399108] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:30,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:30,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:30,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324895416] [2021-12-16 09:32:30,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:30,278 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:30,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:30,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:32:30,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:32:30,279 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. cyclomatic complexity: 77 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) [2021-12-16 09:32:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:30,337 INFO L93 Difference]: Finished difference Result 194 states and 283 transitions. [2021-12-16 09:32:30,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:32:30,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 283 transitions. [2021-12-16 09:32:30,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 158 [2021-12-16 09:32:30,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 283 transitions. [2021-12-16 09:32:30,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2021-12-16 09:32:30,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2021-12-16 09:32:30,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 283 transitions. [2021-12-16 09:32:30,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:30,344 INFO L681 BuchiCegarLoop]: Abstraction has 194 states and 283 transitions. [2021-12-16 09:32:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 283 transitions. [2021-12-16 09:32:30,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2021-12-16 09:32:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 191 states have (on average 1.4659685863874345) internal successors, (280), 190 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 280 transitions. [2021-12-16 09:32:30,348 INFO L704 BuchiCegarLoop]: Abstraction has 191 states and 280 transitions. [2021-12-16 09:32:30,348 INFO L587 BuchiCegarLoop]: Abstraction has 191 states and 280 transitions. [2021-12-16 09:32:30,348 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-16 09:32:30,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 280 transitions. [2021-12-16 09:32:30,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 155 [2021-12-16 09:32:30,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:30,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:30,350 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,350 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,350 INFO L791 eck$LassoCheckResult]: Stem: 1948#ULTIMATE.startENTRY 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); 1938#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 1925#L59 assume !(0 == mp_add_~a3~0#1 % 256); 1926#L59-1 mp_add_~nb~0#1 := 4; 1943#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1934#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1967#L80-2 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; 2009#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2008#L84 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; 2007#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2005#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2003#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2001#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 1995#L90 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; 1998#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 1996#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 1992#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 1993#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 2012#L95-1 [2021-12-16 09:32:30,350 INFO L793 eck$LassoCheckResult]: Loop: 2012#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 2011#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2010#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1991#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1985#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1976#L80-2 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; 1964#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1965#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2069#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1972#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1973#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 2016#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1957#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1958#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1978#L80-2 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; 1979#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2049#L84 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; 2050#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2115#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2114#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2073#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2072#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 2012#L95-1 [2021-12-16 09:32:30,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:30,351 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 2 times [2021-12-16 09:32:30,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:30,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126139011] [2021-12-16 09:32:30,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:30,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:30,360 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:30,377 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1165423065, now seen corresponding path program 1 times [2021-12-16 09:32:30,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:30,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509630808] [2021-12-16 09:32:30,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:30,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:30,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:30,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509630808] [2021-12-16 09:32:30,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509630808] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:30,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:30,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 09:32:30,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376882600] [2021-12-16 09:32:30,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:30,421 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:30,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:30,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:32:30,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:32:30,422 INFO L87 Difference]: Start difference. First operand 191 states and 280 transitions. cyclomatic complexity: 91 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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) [2021-12-16 09:32:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:30,590 INFO L93 Difference]: Finished difference Result 367 states and 532 transitions. [2021-12-16 09:32:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:32:30,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 367 states and 532 transitions. [2021-12-16 09:32:30,593 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 311 [2021-12-16 09:32:30,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 367 states to 367 states and 532 transitions. [2021-12-16 09:32:30,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2021-12-16 09:32:30,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2021-12-16 09:32:30,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 367 states and 532 transitions. [2021-12-16 09:32:30,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:30,595 INFO L681 BuchiCegarLoop]: Abstraction has 367 states and 532 transitions. [2021-12-16 09:32:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states and 532 transitions. [2021-12-16 09:32:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 288. [2021-12-16 09:32:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 288 states have (on average 1.4548611111111112) internal successors, (419), 287 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 419 transitions. [2021-12-16 09:32:30,608 INFO L704 BuchiCegarLoop]: Abstraction has 288 states and 419 transitions. [2021-12-16 09:32:30,608 INFO L587 BuchiCegarLoop]: Abstraction has 288 states and 419 transitions. [2021-12-16 09:32:30,608 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-16 09:32:30,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 419 transitions. [2021-12-16 09:32:30,609 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 249 [2021-12-16 09:32:30,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:30,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:30,610 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,610 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,611 INFO L791 eck$LassoCheckResult]: Stem: 2516#ULTIMATE.startENTRY 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); 2507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 2494#L59 assume !(0 == mp_add_~a3~0#1 % 256); 2495#L59-1 mp_add_~nb~0#1 := 4; 2512#L69 assume !(0 == mp_add_~b3~0#1 % 256); 2503#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 2532#L80-2 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; 2582#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2581#L84 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; 2580#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2578#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2576#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2574#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 2568#L90 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; 2571#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 2569#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 2565#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 2566#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 2595#L95-1 [2021-12-16 09:32:30,611 INFO L793 eck$LassoCheckResult]: Loop: 2595#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 2596#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2591#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2592#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2587#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2588#L80-2 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; 2583#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 2584#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2722#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 2721#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 2719#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2713#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 2710#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 2545#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2542#L80-2 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; 2543#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2662#L84 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; 2533#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2520#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2521#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2715#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2714#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 2595#L95-1 [2021-12-16 09:32:30,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:30,611 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 3 times [2021-12-16 09:32:30,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:30,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392234978] [2021-12-16 09:32:30,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:30,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:30,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:30,631 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:30,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:30,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1115550935, now seen corresponding path program 1 times [2021-12-16 09:32:30,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:30,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894430605] [2021-12-16 09:32:30,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:30,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 09:32:30,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:30,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894430605] [2021-12-16 09:32:30,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894430605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:30,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:30,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:30,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38315887] [2021-12-16 09:32:30,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:30,647 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:30,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:30,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:32:30,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:32:30,649 INFO L87 Difference]: Start difference. First operand 288 states and 419 transitions. cyclomatic complexity: 134 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2021-12-16 09:32:30,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:30,703 INFO L93 Difference]: Finished difference Result 340 states and 495 transitions. [2021-12-16 09:32:30,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:32:30,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 340 states and 495 transitions. [2021-12-16 09:32:30,706 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 301 [2021-12-16 09:32:30,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 340 states to 340 states and 495 transitions. [2021-12-16 09:32:30,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 340 [2021-12-16 09:32:30,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 340 [2021-12-16 09:32:30,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 340 states and 495 transitions. [2021-12-16 09:32:30,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:30,709 INFO L681 BuchiCegarLoop]: Abstraction has 340 states and 495 transitions. [2021-12-16 09:32:30,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states and 495 transitions. [2021-12-16 09:32:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 334. [2021-12-16 09:32:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 334 states have (on average 1.464071856287425) internal successors, (489), 333 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 489 transitions. [2021-12-16 09:32:30,713 INFO L704 BuchiCegarLoop]: Abstraction has 334 states and 489 transitions. [2021-12-16 09:32:30,713 INFO L587 BuchiCegarLoop]: Abstraction has 334 states and 489 transitions. [2021-12-16 09:32:30,714 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-16 09:32:30,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 334 states and 489 transitions. [2021-12-16 09:32:30,715 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 295 [2021-12-16 09:32:30,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:30,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:30,717 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,717 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,717 INFO L791 eck$LassoCheckResult]: Stem: 3152#ULTIMATE.startENTRY 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); 3141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 3134#L59 assume !(0 == mp_add_~a3~0#1 % 256); 3135#L59-1 mp_add_~nb~0#1 := 4; 3146#L69 assume !(0 == mp_add_~b3~0#1 % 256); 3139#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 3173#L80-2 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; 3212#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3211#L84 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; 3210#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3208#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3206#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3204#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 3198#L90 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; 3201#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 3199#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 3195#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 3196#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 3331#L95-1 [2021-12-16 09:32:30,717 INFO L793 eck$LassoCheckResult]: Loop: 3331#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 3238#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3239#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3235#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3231#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3232#L80-2 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; 3285#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 3286#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3402#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 3387#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 3233#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3234#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3223#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 3224#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3179#L80-2 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; 3180#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3308#L84 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; 3309#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3382#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3380#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3378#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3376#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 3331#L95-1 [2021-12-16 09:32:30,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 4 times [2021-12-16 09:32:30,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:30,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148718030] [2021-12-16 09:32:30,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:30,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:30,741 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:30,760 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:30,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:30,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1816615513, now seen corresponding path program 1 times [2021-12-16 09:32:30,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:30,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466253551] [2021-12-16 09:32:30,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:30,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:30,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:30,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466253551] [2021-12-16 09:32:30,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466253551] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:30,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982365073] [2021-12-16 09:32:30,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:30,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:30,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:30,860 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) [2021-12-16 09:32:30,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 09:32:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:30,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 09:32:30,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:31,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:32:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:31,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982365073] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:32:31,157 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:32:31,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2021-12-16 09:32:31,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007461572] [2021-12-16 09:32:31,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:32:31,158 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:31,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:31,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 09:32:31,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-16 09:32:31,158 INFO L87 Difference]: Start difference. First operand 334 states and 489 transitions. cyclomatic complexity: 158 Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:31,423 INFO L93 Difference]: Finished difference Result 481 states and 689 transitions. [2021-12-16 09:32:31,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 09:32:31,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 481 states and 689 transitions. [2021-12-16 09:32:31,425 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 425 [2021-12-16 09:32:31,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 481 states to 481 states and 689 transitions. [2021-12-16 09:32:31,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 481 [2021-12-16 09:32:31,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 481 [2021-12-16 09:32:31,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 481 states and 689 transitions. [2021-12-16 09:32:31,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:31,428 INFO L681 BuchiCegarLoop]: Abstraction has 481 states and 689 transitions. [2021-12-16 09:32:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states and 689 transitions. [2021-12-16 09:32:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 398. [2021-12-16 09:32:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 398 states have (on average 1.4572864321608041) internal successors, (580), 397 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 580 transitions. [2021-12-16 09:32:31,433 INFO L704 BuchiCegarLoop]: Abstraction has 398 states and 580 transitions. [2021-12-16 09:32:31,433 INFO L587 BuchiCegarLoop]: Abstraction has 398 states and 580 transitions. [2021-12-16 09:32:31,433 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-16 09:32:31,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 398 states and 580 transitions. [2021-12-16 09:32:31,435 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 350 [2021-12-16 09:32:31,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:31,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:31,436 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:31,436 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:31,436 INFO L791 eck$LassoCheckResult]: Stem: 4105#ULTIMATE.startENTRY 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); 4096#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 4084#L59 assume !(0 == mp_add_~a3~0#1 % 256); 4085#L59-1 mp_add_~nb~0#1 := 4; 4101#L69 assume !(0 == mp_add_~b3~0#1 % 256); 4092#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4124#L80-2 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; 4188#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4187#L84 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; 4186#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4184#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4182#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4180#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 4174#L90 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; 4177#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 4175#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 4171#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 4172#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 4212#L95-1 [2021-12-16 09:32:31,436 INFO L793 eck$LassoCheckResult]: Loop: 4212#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 4210#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4209#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4208#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4206#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4207#L80-2 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; 4202#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4103#L84 assume !(0 == mp_add_~i~0#1 % 256); 4104#L84-2 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; 4331#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4326#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4311#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4310#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 4353#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4351#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 4350#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4193#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4192#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4159#L80-2 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; 4160#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4292#L84 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; 4125#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4110#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4111#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4374#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4373#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 4212#L95-1 [2021-12-16 09:32:31,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:31,436 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 5 times [2021-12-16 09:32:31,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:31,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139624225] [2021-12-16 09:32:31,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:31,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:31,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:31,451 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1570645289, now seen corresponding path program 1 times [2021-12-16 09:32:31,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:31,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892631956] [2021-12-16 09:32:31,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:31,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:31,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:31,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892631956] [2021-12-16 09:32:31,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892631956] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:31,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:31,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:31,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685166047] [2021-12-16 09:32:31,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:31,484 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:31,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:31,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:32:31,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:32:31,485 INFO L87 Difference]: Start difference. First operand 398 states and 580 transitions. cyclomatic complexity: 185 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:31,608 INFO L93 Difference]: Finished difference Result 543 states and 773 transitions. [2021-12-16 09:32:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 09:32:31,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 543 states and 773 transitions. [2021-12-16 09:32:31,611 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 487 [2021-12-16 09:32:31,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 543 states to 543 states and 773 transitions. [2021-12-16 09:32:31,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 543 [2021-12-16 09:32:31,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 543 [2021-12-16 09:32:31,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 543 states and 773 transitions. [2021-12-16 09:32:31,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:31,614 INFO L681 BuchiCegarLoop]: Abstraction has 543 states and 773 transitions. [2021-12-16 09:32:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states and 773 transitions. [2021-12-16 09:32:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 388. [2021-12-16 09:32:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 388 states have (on average 1.4639175257731958) internal successors, (568), 387 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 568 transitions. [2021-12-16 09:32:31,621 INFO L704 BuchiCegarLoop]: Abstraction has 388 states and 568 transitions. [2021-12-16 09:32:31,621 INFO L587 BuchiCegarLoop]: Abstraction has 388 states and 568 transitions. [2021-12-16 09:32:31,621 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-16 09:32:31,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 388 states and 568 transitions. [2021-12-16 09:32:31,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 350 [2021-12-16 09:32:31,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:31,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:31,625 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:31,625 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:31,625 INFO L791 eck$LassoCheckResult]: Stem: 5056#ULTIMATE.startENTRY 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); 5046#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 5035#L59 assume !(0 == mp_add_~a3~0#1 % 256); 5036#L59-1 mp_add_~nb~0#1 := 4; 5051#L69 assume !(0 == mp_add_~b3~0#1 % 256); 5042#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 5076#L80-2 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; 5118#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5117#L84 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; 5116#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 5114#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 5112#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 5110#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 5104#L90 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; 5107#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 5105#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 5101#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 5102#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 5180#L95-1 [2021-12-16 09:32:31,625 INFO L793 eck$LassoCheckResult]: Loop: 5180#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 5177#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5176#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5175#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5174#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5173#L80-2 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; 5170#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5171#L84 assume !(0 == mp_add_~i~0#1 % 256); 5224#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 5162#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 5155#L86-1 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; 5153#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5146#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 5147#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5179#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5137#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5131#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 5132#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5221#L80-2 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; 5218#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5216#L84 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; 5169#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 5256#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 5257#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 5247#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5246#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 5180#L95-1 [2021-12-16 09:32:31,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:31,626 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 6 times [2021-12-16 09:32:31,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:31,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872570480] [2021-12-16 09:32:31,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:31,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:31,638 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:31,656 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:31,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:31,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1248761385, now seen corresponding path program 1 times [2021-12-16 09:32:31,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:31,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619790957] [2021-12-16 09:32:31,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:31,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:31,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:31,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619790957] [2021-12-16 09:32:31,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619790957] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:31,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:31,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:31,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253972310] [2021-12-16 09:32:31,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:31,695 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:31,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:31,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:32:31,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:32:31,697 INFO L87 Difference]: Start difference. First operand 388 states and 568 transitions. cyclomatic complexity: 182 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:31,812 INFO L93 Difference]: Finished difference Result 577 states and 821 transitions. [2021-12-16 09:32:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 09:32:31,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 577 states and 821 transitions. [2021-12-16 09:32:31,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 521 [2021-12-16 09:32:31,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 577 states to 577 states and 821 transitions. [2021-12-16 09:32:31,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 577 [2021-12-16 09:32:31,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 577 [2021-12-16 09:32:31,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 577 states and 821 transitions. [2021-12-16 09:32:31,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:31,818 INFO L681 BuchiCegarLoop]: Abstraction has 577 states and 821 transitions. [2021-12-16 09:32:31,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states and 821 transitions. [2021-12-16 09:32:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 470. [2021-12-16 09:32:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 470 states have (on average 1.4425531914893617) internal successors, (678), 469 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 678 transitions. [2021-12-16 09:32:31,825 INFO L704 BuchiCegarLoop]: Abstraction has 470 states and 678 transitions. [2021-12-16 09:32:31,825 INFO L587 BuchiCegarLoop]: Abstraction has 470 states and 678 transitions. [2021-12-16 09:32:31,825 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-16 09:32:31,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 470 states and 678 transitions. [2021-12-16 09:32:31,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 425 [2021-12-16 09:32:31,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:31,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:31,827 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:31,827 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2021-12-16 09:32:31,827 INFO L791 eck$LassoCheckResult]: Stem: 6033#ULTIMATE.startENTRY 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); 6023#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 6010#L59 assume !(0 == mp_add_~a3~0#1 % 256); 6011#L59-1 mp_add_~nb~0#1 := 4; 6028#L69 assume !(0 == mp_add_~b3~0#1 % 256); 6018#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 6053#L80-2 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; 6105#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6104#L84 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; 6103#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6101#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6099#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6097#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 6091#L90 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; 6094#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 6092#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 6088#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 6089#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 6346#L95-1 [2021-12-16 09:32:31,827 INFO L793 eck$LassoCheckResult]: Loop: 6346#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 6267#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6345#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6344#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6343#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6342#L80-2 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; 6340#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6338#L84 assume !(0 == mp_add_~i~0#1 % 256); 6339#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6324#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6326#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6263#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6158#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 6154#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6150#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6106#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6108#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6066#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6067#L80-2 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; 6139#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6140#L84 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; 6292#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6360#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6355#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6352#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6351#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 6346#L95-1 [2021-12-16 09:32:31,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:31,828 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 7 times [2021-12-16 09:32:31,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:31,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042304651] [2021-12-16 09:32:31,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:31,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:31,834 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:31,842 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:31,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:31,842 INFO L85 PathProgramCache]: Analyzing trace with hash -165333979, now seen corresponding path program 1 times [2021-12-16 09:32:31,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:31,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68308046] [2021-12-16 09:32:31,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:31,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:31,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:31,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68308046] [2021-12-16 09:32:31,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68308046] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:31,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162530145] [2021-12-16 09:32:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:31,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:31,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:31,893 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) [2021-12-16 09:32:31,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 09:32:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:31,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:32:31,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:32,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:32:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:32,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162530145] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:32:32,218 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:32:32,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-12-16 09:32:32,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859006915] [2021-12-16 09:32:32,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:32:32,219 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:32,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:32,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 09:32:32,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-16 09:32:32,220 INFO L87 Difference]: Start difference. First operand 470 states and 678 transitions. cyclomatic complexity: 210 Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:32,449 INFO L93 Difference]: Finished difference Result 554 states and 763 transitions. [2021-12-16 09:32:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 09:32:32,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 554 states and 763 transitions. [2021-12-16 09:32:32,452 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 496 [2021-12-16 09:32:32,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 554 states to 554 states and 763 transitions. [2021-12-16 09:32:32,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 554 [2021-12-16 09:32:32,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 554 [2021-12-16 09:32:32,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 554 states and 763 transitions. [2021-12-16 09:32:32,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:32,454 INFO L681 BuchiCegarLoop]: Abstraction has 554 states and 763 transitions. [2021-12-16 09:32:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states and 763 transitions. [2021-12-16 09:32:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 418. [2021-12-16 09:32:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 418 states have (on average 1.4138755980861244) internal successors, (591), 417 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 591 transitions. [2021-12-16 09:32:32,461 INFO L704 BuchiCegarLoop]: Abstraction has 418 states and 591 transitions. [2021-12-16 09:32:32,461 INFO L587 BuchiCegarLoop]: Abstraction has 418 states and 591 transitions. [2021-12-16 09:32:32,461 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-16 09:32:32,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 418 states and 591 transitions. [2021-12-16 09:32:32,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 373 [2021-12-16 09:32:32,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:32,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:32,463 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:32,463 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:32,463 INFO L791 eck$LassoCheckResult]: Stem: 7229#ULTIMATE.startENTRY 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); 7220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 7213#L59 assume !(0 == mp_add_~a3~0#1 % 256); 7214#L59-1 mp_add_~nb~0#1 := 4; 7225#L69 assume !(0 == mp_add_~b3~0#1 % 256); 7218#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 7311#L80-2 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; 7312#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7307#L84 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; 7308#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 7304#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7303#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7302#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 7301#L90 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; 7300#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 7299#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 7298#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 7292#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 7293#L95-1 [2021-12-16 09:32:32,463 INFO L793 eck$LassoCheckResult]: Loop: 7293#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 7348#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7454#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7455#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7452#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7453#L80-2 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; 7521#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7519#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7511#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 7507#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7432#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 7355#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7431#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7430#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7428#L80-2 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; 7378#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7365#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7367#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 7478#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7354#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7356#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7338#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7336#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7328#L80-2 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; 7329#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7334#L84 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; 7330#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 7331#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7321#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7315#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7295#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 7293#L95-1 [2021-12-16 09:32:32,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 8 times [2021-12-16 09:32:32,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:32,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443188898] [2021-12-16 09:32:32,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:32,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:32,470 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:32,477 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:32,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1557912240, now seen corresponding path program 2 times [2021-12-16 09:32:32,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:32,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651871441] [2021-12-16 09:32:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:32,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:32,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:32,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651871441] [2021-12-16 09:32:32,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651871441] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:32,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:32,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:32,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139019311] [2021-12-16 09:32:32,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:32,504 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:32,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:32,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:32:32,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:32:32,504 INFO L87 Difference]: Start difference. First operand 418 states and 591 transitions. cyclomatic complexity: 175 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:32,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:32,543 INFO L93 Difference]: Finished difference Result 427 states and 585 transitions. [2021-12-16 09:32:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:32:32,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 427 states and 585 transitions. [2021-12-16 09:32:32,547 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 373 [2021-12-16 09:32:32,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 427 states to 427 states and 585 transitions. [2021-12-16 09:32:32,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 427 [2021-12-16 09:32:32,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2021-12-16 09:32:32,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 427 states and 585 transitions. [2021-12-16 09:32:32,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:32,549 INFO L681 BuchiCegarLoop]: Abstraction has 427 states and 585 transitions. [2021-12-16 09:32:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states and 585 transitions. [2021-12-16 09:32:32,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 363. [2021-12-16 09:32:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 363 states have (on average 1.3801652892561984) internal successors, (501), 362 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 501 transitions. [2021-12-16 09:32:32,561 INFO L704 BuchiCegarLoop]: Abstraction has 363 states and 501 transitions. [2021-12-16 09:32:32,561 INFO L587 BuchiCegarLoop]: Abstraction has 363 states and 501 transitions. [2021-12-16 09:32:32,561 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-16 09:32:32,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 363 states and 501 transitions. [2021-12-16 09:32:32,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 318 [2021-12-16 09:32:32,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:32,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:32,563 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:32,563 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:32,564 INFO L791 eck$LassoCheckResult]: Stem: 8081#ULTIMATE.startENTRY 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); 8072#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 8061#L59 assume !(0 == mp_add_~a3~0#1 % 256); 8062#L59-1 mp_add_~nb~0#1 := 4; 8077#L69 assume !(0 == mp_add_~b3~0#1 % 256); 8068#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 8100#L80-2 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; 8199#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8200#L84 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; 8101#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8102#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8232#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8231#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 8227#L90 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; 8228#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 8225#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 8224#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 8220#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 8219#L95-1 [2021-12-16 09:32:32,564 INFO L793 eck$LassoCheckResult]: Loop: 8219#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 8362#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8361#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8360#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8359#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8358#L80-2 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; 8205#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8206#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8065#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8066#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8404#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 8174#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8401#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8396#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8118#L80-2 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; 8119#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8188#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8187#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8180#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8181#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8165#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8128#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8129#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8120#L80-2 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; 8121#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8156#L84 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; 8154#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8155#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8147#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8144#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 8145#L90 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; 8162#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 8146#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 8142#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 8143#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 8219#L95-1 [2021-12-16 09:32:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 9 times [2021-12-16 09:32:32,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:32,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328078980] [2021-12-16 09:32:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:32,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:32,577 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:32,590 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:32,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:32,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1327903996, now seen corresponding path program 1 times [2021-12-16 09:32:32,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:32,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943759668] [2021-12-16 09:32:32,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:32,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 09:32:32,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:32,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943759668] [2021-12-16 09:32:32,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943759668] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:32,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388609577] [2021-12-16 09:32:32,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:32,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:32,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:32,692 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) [2021-12-16 09:32:32,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 09:32:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:32,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 09:32:32,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 09:32:32,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:32:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 09:32:32,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388609577] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:32:32,862 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:32:32,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2021-12-16 09:32:32,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086919837] [2021-12-16 09:32:32,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:32:32,863 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:32,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:32,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 09:32:32,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-16 09:32:32,863 INFO L87 Difference]: Start difference. First operand 363 states and 501 transitions. cyclomatic complexity: 140 Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:33,753 INFO L93 Difference]: Finished difference Result 551 states and 708 transitions. [2021-12-16 09:32:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-16 09:32:33,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 551 states and 708 transitions. [2021-12-16 09:32:33,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 457 [2021-12-16 09:32:33,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 551 states to 551 states and 708 transitions. [2021-12-16 09:32:33,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 551 [2021-12-16 09:32:33,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 551 [2021-12-16 09:32:33,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 551 states and 708 transitions. [2021-12-16 09:32:33,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:33,759 INFO L681 BuchiCegarLoop]: Abstraction has 551 states and 708 transitions. [2021-12-16 09:32:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states and 708 transitions. [2021-12-16 09:32:33,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 300. [2021-12-16 09:32:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 300 states have (on average 1.3033333333333332) internal successors, (391), 299 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 391 transitions. [2021-12-16 09:32:33,764 INFO L704 BuchiCegarLoop]: Abstraction has 300 states and 391 transitions. [2021-12-16 09:32:33,764 INFO L587 BuchiCegarLoop]: Abstraction has 300 states and 391 transitions. [2021-12-16 09:32:33,764 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-16 09:32:33,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 391 transitions. [2021-12-16 09:32:33,766 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 250 [2021-12-16 09:32:33,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:33,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:33,767 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:33,767 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:33,767 INFO L791 eck$LassoCheckResult]: Stem: 9300#ULTIMATE.startENTRY 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); 9291#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 9284#L59 assume !(0 == mp_add_~a3~0#1 % 256); 9285#L59-1 mp_add_~nb~0#1 := 4; 9296#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 9288#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 9290#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 9322#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 9323#L80-2 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; 9453#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9454#L84 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; 9448#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 9449#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 9441#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 9442#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 9547#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 9434#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 9546#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 9550#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 9549#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9548#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9303#L80-2 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; 9304#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9298#L84 assume !(0 == mp_add_~i~0#1 % 256); 9299#L84-2 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; 9305#L85-1 [2021-12-16 09:32:33,767 INFO L793 eck$LassoCheckResult]: Loop: 9305#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 9306#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 9562#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9555#L90 assume !(0 == mp_add_~i~0#1 % 256); 9557#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 9488#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 9553#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 9551#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 9545#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 9390#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 9388#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 9387#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9382#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9372#L80-2 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; 9373#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9379#L84 assume !(0 == mp_add_~i~0#1 % 256); 9538#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 9370#L85-1 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; 9371#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 9364#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 9363#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 9533#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 9531#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 9530#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 9529#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9528#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9527#L80-2 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; 9525#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 9526#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 9539#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 9516#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 9297#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 9286#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 9287#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 9312#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9315#L80-2 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; 9317#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9318#L84 assume !(0 == mp_add_~i~0#1 % 256); 9513#L84-2 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; 9305#L85-1 [2021-12-16 09:32:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:33,768 INFO L85 PathProgramCache]: Analyzing trace with hash -311032260, now seen corresponding path program 1 times [2021-12-16 09:32:33,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:33,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130069727] [2021-12-16 09:32:33,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:33,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:33,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:33,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130069727] [2021-12-16 09:32:33,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130069727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:33,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:33,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 09:32:33,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350668051] [2021-12-16 09:32:33,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:33,850 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:33,850 INFO L85 PathProgramCache]: Analyzing trace with hash -976224508, now seen corresponding path program 1 times [2021-12-16 09:32:33,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:33,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441826795] [2021-12-16 09:32:33,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:33,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:33,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:33,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441826795] [2021-12-16 09:32:33,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441826795] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:33,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102247443] [2021-12-16 09:32:33,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:33,892 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:33,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:33,904 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:33,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-16 09:32:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:33,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:32:33,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-16 09:32:34,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 09:32:34,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102247443] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:34,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 09:32:34,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-12-16 09:32:34,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724132365] [2021-12-16 09:32:34,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:34,001 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:34,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:34,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 09:32:34,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 09:32:34,001 INFO L87 Difference]: Start difference. First operand 300 states and 391 transitions. cyclomatic complexity: 93 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:34,388 INFO L93 Difference]: Finished difference Result 1143 states and 1494 transitions. [2021-12-16 09:32:34,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 09:32:34,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1143 states and 1494 transitions. [2021-12-16 09:32:34,393 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1000 [2021-12-16 09:32:34,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1143 states to 1143 states and 1494 transitions. [2021-12-16 09:32:34,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1143 [2021-12-16 09:32:34,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1143 [2021-12-16 09:32:34,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1143 states and 1494 transitions. [2021-12-16 09:32:34,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:34,397 INFO L681 BuchiCegarLoop]: Abstraction has 1143 states and 1494 transitions. [2021-12-16 09:32:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states and 1494 transitions. [2021-12-16 09:32:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 291. [2021-12-16 09:32:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 291 states have (on average 1.309278350515464) internal successors, (381), 290 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 381 transitions. [2021-12-16 09:32:34,402 INFO L704 BuchiCegarLoop]: Abstraction has 291 states and 381 transitions. [2021-12-16 09:32:34,402 INFO L587 BuchiCegarLoop]: Abstraction has 291 states and 381 transitions. [2021-12-16 09:32:34,403 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-16 09:32:34,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 381 transitions. [2021-12-16 09:32:34,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 250 [2021-12-16 09:32:34,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:34,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:34,404 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [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] [2021-12-16 09:32:34,404 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:34,404 INFO L791 eck$LassoCheckResult]: Stem: 10886#ULTIMATE.startENTRY 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); 10875#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 10868#L59 assume !(0 == mp_add_~a3~0#1 % 256); 10869#L59-1 mp_add_~nb~0#1 := 4; 10880#L69 assume !(0 == mp_add_~b3~0#1 % 256); 10873#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 10904#L80-2 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; 11111#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 11109#L84 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; 11107#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 11105#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 11103#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 11101#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 11099#L90 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; 11097#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 11096#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 11095#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 10865#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 10866#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 11119#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 11118#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 11117#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 11116#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11115#L80-2 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; 11113#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 11094#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 11091#L89 [2021-12-16 09:32:34,405 INFO L793 eck$LassoCheckResult]: Loop: 11091#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 11032#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10976#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 10974#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10973#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10940#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10941#L80-2 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; 10966#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 10965#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 10960#L90 assume !(0 == mp_add_~i~0#1 % 256); 10961#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 10948#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 10949#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 10939#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 10938#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10937#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10936#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 10933#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10931#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10926#L80-2 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; 10900#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 10882#L84 assume !(0 == mp_add_~i~0#1 % 256); 10883#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 10903#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 11143#L86-1 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; 11140#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 10864#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 10991#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10988#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10985#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10981#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 10982#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10928#L80-2 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; 10929#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 11073#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 11072#L90 assume !(0 == mp_add_~i~0#1 % 256); 11071#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 11047#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 11093#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 11091#L89 [2021-12-16 09:32:34,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:34,405 INFO L85 PathProgramCache]: Analyzing trace with hash 465531897, now seen corresponding path program 1 times [2021-12-16 09:32:34,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:34,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783937790] [2021-12-16 09:32:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:34,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:34,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:34,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783937790] [2021-12-16 09:32:34,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783937790] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:34,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494218573] [2021-12-16 09:32:34,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:34,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:34,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:34,450 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:34,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-16 09:32:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:34,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 09:32:34,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:34,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 09:32:34,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494218573] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:34,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 09:32:34,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2021-12-16 09:32:34,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507030494] [2021-12-16 09:32:34,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:34,655 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:34,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:34,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1226285746, now seen corresponding path program 1 times [2021-12-16 09:32:34,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:34,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822770564] [2021-12-16 09:32:34,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:34,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-16 09:32:34,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:34,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822770564] [2021-12-16 09:32:34,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822770564] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:34,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599192409] [2021-12-16 09:32:34,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:34,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:34,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:34,694 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:34,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-16 09:32:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:34,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:32:34,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 09:32:46,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 09:32:46,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599192409] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:46,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 09:32:46,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2021-12-16 09:32:46,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558531226] [2021-12-16 09:32:46,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:46,966 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:46,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:46,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 09:32:46,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-16 09:32:46,966 INFO L87 Difference]: Start difference. First operand 291 states and 381 transitions. cyclomatic complexity: 92 Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:47,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:47,115 INFO L93 Difference]: Finished difference Result 344 states and 442 transitions. [2021-12-16 09:32:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:32:47,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 442 transitions. [2021-12-16 09:32:47,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 280 [2021-12-16 09:32:47,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 344 states and 442 transitions. [2021-12-16 09:32:47,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 344 [2021-12-16 09:32:47,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 344 [2021-12-16 09:32:47,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 344 states and 442 transitions. [2021-12-16 09:32:47,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:47,118 INFO L681 BuchiCegarLoop]: Abstraction has 344 states and 442 transitions. [2021-12-16 09:32:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states and 442 transitions. [2021-12-16 09:32:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 314. [2021-12-16 09:32:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 314 states have (on average 1.2898089171974523) internal successors, (405), 313 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 405 transitions. [2021-12-16 09:32:47,122 INFO L704 BuchiCegarLoop]: Abstraction has 314 states and 405 transitions. [2021-12-16 09:32:47,122 INFO L587 BuchiCegarLoop]: Abstraction has 314 states and 405 transitions. [2021-12-16 09:32:47,122 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-16 09:32:47,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 405 transitions. [2021-12-16 09:32:47,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 250 [2021-12-16 09:32:47,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:47,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:47,123 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [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] [2021-12-16 09:32:47,124 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:47,124 INFO L791 eck$LassoCheckResult]: Stem: 11724#ULTIMATE.startENTRY 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); 11715#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 11704#L59 assume !(0 == mp_add_~a3~0#1 % 256); 11705#L59-1 mp_add_~nb~0#1 := 4; 11720#L69 assume !(0 == mp_add_~b3~0#1 % 256); 11711#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 11726#L80-2 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; 11727#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 11995#L84 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; 11994#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 11993#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 11992#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 11991#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 11990#L90 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; 11989#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 11988#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 11986#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 11983#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 11981#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 11979#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 11977#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 11975#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 11973#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11971#L80-2 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; 11969#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 11967#L84 assume !(0 == mp_add_~i~0#1 % 256); 11964#L84-2 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; 11961#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 11959#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 11956#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 11953#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 11952#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 11950#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 11948#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 11946#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 11944#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11942#L80-2 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; 11941#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 11814#L84 [2021-12-16 09:32:47,124 INFO L793 eck$LassoCheckResult]: Loop: 11814#L84 assume !(0 == mp_add_~i~0#1 % 256); 11815#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 11803#L85-1 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; 11804#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 11940#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 11938#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 11936#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 11932#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 11931#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 11929#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 11927#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11924#L80-2 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; 11922#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 11921#L84 assume !(0 == mp_add_~i~0#1 % 256); 11920#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 11899#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 11898#L86-1 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; 11895#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 11892#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 11886#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 11879#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 11857#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 11854#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 11853#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11852#L80-2 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; 11850#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 11851#L84 assume !(0 == mp_add_~i~0#1 % 256); 11919#L84-2 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; 11872#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 11869#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 11865#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 11860#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 11858#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 11816#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 11817#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 11805#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 11806#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11796#L80-2 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; 11797#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 11814#L84 [2021-12-16 09:32:47,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:47,124 INFO L85 PathProgramCache]: Analyzing trace with hash 149180734, now seen corresponding path program 1 times [2021-12-16 09:32:47,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:47,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059288242] [2021-12-16 09:32:47,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:47,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:47,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:47,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059288242] [2021-12-16 09:32:47,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059288242] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:47,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507325540] [2021-12-16 09:32:47,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:47,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:47,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:47,210 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:47,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-16 09:32:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:47,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:32:47,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 09:32:47,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:32:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:47,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507325540] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:32:47,565 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:32:47,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2021-12-16 09:32:47,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208403734] [2021-12-16 09:32:47,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:32:47,565 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:47,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:47,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1157006514, now seen corresponding path program 1 times [2021-12-16 09:32:47,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:47,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846973408] [2021-12-16 09:32:47,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:47,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:47,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:47,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846973408] [2021-12-16 09:32:47,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846973408] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:47,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406265588] [2021-12-16 09:32:47,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:47,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:47,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:47,600 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:47,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-16 09:32:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:47,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:32:47,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 09:32:47,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 09:32:47,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406265588] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:47,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 09:32:47,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2021-12-16 09:32:47,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216390011] [2021-12-16 09:32:47,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:47,709 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:47,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:47,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 09:32:47,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2021-12-16 09:32:47,710 INFO L87 Difference]: Start difference. First operand 314 states and 405 transitions. cyclomatic complexity: 93 Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 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) [2021-12-16 09:32:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:48,249 INFO L93 Difference]: Finished difference Result 1174 states and 1491 transitions. [2021-12-16 09:32:48,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 09:32:48,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1174 states and 1491 transitions. [2021-12-16 09:32:48,259 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 958 [2021-12-16 09:32:48,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1174 states to 1174 states and 1491 transitions. [2021-12-16 09:32:48,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1174 [2021-12-16 09:32:48,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1174 [2021-12-16 09:32:48,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1174 states and 1491 transitions. [2021-12-16 09:32:48,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:48,264 INFO L681 BuchiCegarLoop]: Abstraction has 1174 states and 1491 transitions. [2021-12-16 09:32:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states and 1491 transitions. [2021-12-16 09:32:48,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 720. [2021-12-16 09:32:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 720 states have (on average 1.2944444444444445) internal successors, (932), 719 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 932 transitions. [2021-12-16 09:32:48,273 INFO L704 BuchiCegarLoop]: Abstraction has 720 states and 932 transitions. [2021-12-16 09:32:48,273 INFO L587 BuchiCegarLoop]: Abstraction has 720 states and 932 transitions. [2021-12-16 09:32:48,273 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-12-16 09:32:48,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 720 states and 932 transitions. [2021-12-16 09:32:48,276 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 569 [2021-12-16 09:32:48,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:48,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:48,277 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1] [2021-12-16 09:32:48,277 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:48,277 INFO L791 eck$LassoCheckResult]: Stem: 13582#ULTIMATE.startENTRY 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); 13571#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 13558#L59 assume !(0 == mp_add_~a3~0#1 % 256); 13559#L59-1 mp_add_~nb~0#1 := 4; 13576#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 13565#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 13567#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 13604#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 13865#L80-2 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; 13864#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 13863#L84 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; 13862#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 13861#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 13860#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 13859#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 13858#L90 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; 13857#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 13856#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 13855#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 13853#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 13852#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 13851#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13850#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13849#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13848#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13847#L80-2 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; 13846#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 13845#L84 assume !(0 == mp_add_~i~0#1 % 256); 13844#L84-2 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; 13843#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 13842#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 13840#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 13838#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 13837#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13836#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 13834#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13833#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13832#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13831#L80-2 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; 13830#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 13829#L84 [2021-12-16 09:32:48,277 INFO L793 eck$LassoCheckResult]: Loop: 13829#L84 assume !(0 == mp_add_~i~0#1 % 256); 13828#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 13827#L85-1 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; 13826#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 13824#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 13822#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 13821#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13820#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13818#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 13811#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13744#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13741#L80-2 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; 13738#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 13735#L84 assume !(0 == mp_add_~i~0#1 % 256); 13732#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 13729#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 13726#L86-1 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; 13722#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 13718#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 13715#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13712#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13709#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13710#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 13788#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13742#L80-2 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; 13743#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 13784#L84 assume !(0 == mp_add_~i~0#1 % 256); 13779#L84-2 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; 13777#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 13765#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 13766#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 13895#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 13754#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13664#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 13665#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13660#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13661#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13656#L80-2 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; 13657#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 13829#L84 [2021-12-16 09:32:48,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:48,277 INFO L85 PathProgramCache]: Analyzing trace with hash -764527287, now seen corresponding path program 1 times [2021-12-16 09:32:48,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:48,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102276177] [2021-12-16 09:32:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:48,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:48,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:48,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102276177] [2021-12-16 09:32:48,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102276177] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:48,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062704367] [2021-12-16 09:32:48,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:48,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:48,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:48,364 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:48,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-16 09:32:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:48,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 09:32:48,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:48,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:32:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:48,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062704367] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:32:48,719 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:32:48,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2021-12-16 09:32:48,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733391682] [2021-12-16 09:32:48,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:32:48,720 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:48,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:48,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1157006514, now seen corresponding path program 2 times [2021-12-16 09:32:48,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:48,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171506176] [2021-12-16 09:32:48,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:48,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:48,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:48,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171506176] [2021-12-16 09:32:48,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171506176] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:48,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828561120] [2021-12-16 09:32:48,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:32:48,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:48,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:48,774 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:48,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-16 09:32:48,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 09:32:48,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:32:48,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:32:48,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 09:32:48,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:32:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 09:32:49,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828561120] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:32:49,023 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:32:49,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-16 09:32:49,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553066309] [2021-12-16 09:32:49,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:32:49,023 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:49,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:49,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 09:32:49,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-16 09:32:49,024 INFO L87 Difference]: Start difference. First operand 720 states and 932 transitions. cyclomatic complexity: 217 Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:49,398 INFO L93 Difference]: Finished difference Result 652 states and 749 transitions. [2021-12-16 09:32:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 09:32:49,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 652 states and 749 transitions. [2021-12-16 09:32:49,401 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 314 [2021-12-16 09:32:49,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 652 states to 636 states and 723 transitions. [2021-12-16 09:32:49,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 636 [2021-12-16 09:32:49,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 636 [2021-12-16 09:32:49,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 636 states and 723 transitions. [2021-12-16 09:32:49,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:49,403 INFO L681 BuchiCegarLoop]: Abstraction has 636 states and 723 transitions. [2021-12-16 09:32:49,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states and 723 transitions. [2021-12-16 09:32:49,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 316. [2021-12-16 09:32:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.129746835443038) internal successors, (357), 315 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 357 transitions. [2021-12-16 09:32:49,408 INFO L704 BuchiCegarLoop]: Abstraction has 316 states and 357 transitions. [2021-12-16 09:32:49,408 INFO L587 BuchiCegarLoop]: Abstraction has 316 states and 357 transitions. [2021-12-16 09:32:49,408 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-12-16 09:32:49,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 357 transitions. [2021-12-16 09:32:49,409 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 179 [2021-12-16 09:32:49,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:49,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:49,409 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 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, 1, 1, 1] [2021-12-16 09:32:49,409 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2021-12-16 09:32:49,410 INFO L791 eck$LassoCheckResult]: Stem: 15456#ULTIMATE.startENTRY 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); 15445#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 15438#L59 assume !(0 == mp_add_~a3~0#1 % 256); 15439#L59-1 mp_add_~nb~0#1 := 4; 15450#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 15442#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 15444#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 15471#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 15563#L80-2 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; 15562#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 15561#L84 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; 15560#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 15559#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 15558#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 15557#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 15556#L90 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; 15555#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 15554#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 15553#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 15551#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 15550#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 15549#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 15548#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15547#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 15546#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15545#L80-2 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; 15544#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 15543#L84 assume !(0 == mp_add_~i~0#1 % 256); 15541#L84-2 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; 15540#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 15538#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 15535#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 15532#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 15533#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 15613#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 15611#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15609#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 15607#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15605#L80-2 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; 15606#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 15734#L84 assume !(0 == mp_add_~i~0#1 % 256); 15733#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 15599#L85-1 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; 15598#L86-1 [2021-12-16 09:32:49,410 INFO L793 eck$LassoCheckResult]: Loop: 15598#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 15523#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 15434#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 15435#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 15451#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 15452#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 15715#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 15714#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15713#L80-2 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; 15710#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 15454#L84 assume !(0 == mp_add_~i~0#1 % 256); 15455#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 15469#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 15741#L86-1 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; 15507#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 15740#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 15499#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 15737#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 15440#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15441#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 15463#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15459#L80-2 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; 15460#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 15467#L84 assume !(0 == mp_add_~i~0#1 % 256); 15739#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 15738#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 15490#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 15484#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 15482#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 15480#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 15481#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 15477#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15476#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 15474#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15475#L80-2 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; 15603#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 15602#L84 assume !(0 == mp_add_~i~0#1 % 256); 15600#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 15601#L85-1 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; 15598#L86-1 [2021-12-16 09:32:49,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:49,410 INFO L85 PathProgramCache]: Analyzing trace with hash 880285046, now seen corresponding path program 1 times [2021-12-16 09:32:49,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:49,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245748305] [2021-12-16 09:32:49,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:49,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:49,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:49,434 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:49,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1037296432, now seen corresponding path program 1 times [2021-12-16 09:32:49,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:49,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478222875] [2021-12-16 09:32:49,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:49,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:49,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:49,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478222875] [2021-12-16 09:32:49,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478222875] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:49,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41580831] [2021-12-16 09:32:49,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:49,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:49,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:49,475 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:49,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-16 09:32:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:49,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 09:32:49,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 09:32:49,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:32:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 09:32:49,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41580831] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:32:49,762 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:32:49,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2021-12-16 09:32:49,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176820676] [2021-12-16 09:32:49,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:32:49,762 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:49,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:49,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 09:32:49,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-12-16 09:32:49,763 INFO L87 Difference]: Start difference. First operand 316 states and 357 transitions. cyclomatic complexity: 44 Second operand has 12 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:50,186 INFO L93 Difference]: Finished difference Result 375 states and 418 transitions. [2021-12-16 09:32:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 09:32:50,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 418 transitions. [2021-12-16 09:32:50,188 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 48 [2021-12-16 09:32:50,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 369 states and 410 transitions. [2021-12-16 09:32:50,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 369 [2021-12-16 09:32:50,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 369 [2021-12-16 09:32:50,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 369 states and 410 transitions. [2021-12-16 09:32:50,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:50,190 INFO L681 BuchiCegarLoop]: Abstraction has 369 states and 410 transitions. [2021-12-16 09:32:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states and 410 transitions. [2021-12-16 09:32:50,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 279. [2021-12-16 09:32:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 279 states have (on average 1.103942652329749) internal successors, (308), 278 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 308 transitions. [2021-12-16 09:32:50,193 INFO L704 BuchiCegarLoop]: Abstraction has 279 states and 308 transitions. [2021-12-16 09:32:50,193 INFO L587 BuchiCegarLoop]: Abstraction has 279 states and 308 transitions. [2021-12-16 09:32:50,193 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-12-16 09:32:50,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 308 transitions. [2021-12-16 09:32:50,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2021-12-16 09:32:50,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:50,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:50,195 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:50,195 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:50,196 INFO L791 eck$LassoCheckResult]: Stem: 16404#ULTIMATE.startENTRY 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); 16394#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#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~nondet1#1;havoc main_#t~nondet1#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_~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_~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; 16382#L59 assume !(0 == mp_add_~a3~0#1 % 256); 16383#L59-1 mp_add_~nb~0#1 := 4; 16399#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 16389#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 16391#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 16417#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 16593#L80-2 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; 16591#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 16589#L84 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; 16587#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 16585#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 16583#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 16581#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 16579#L90 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; 16577#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 16575#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 16572#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 16568#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 16565#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 16562#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 16559#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 16556#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 16553#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 16550#L80-2 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; 16547#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 16544#L84 assume !(0 == mp_add_~i~0#1 % 256); 16541#L84-2 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; 16539#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 16537#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 16533#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 16529#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 16527#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 16525#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 16523#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 16521#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 16519#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 16517#L80-2 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; 16515#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 16513#L84 assume !(0 == mp_add_~i~0#1 % 256); 16510#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 16509#L85-1 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; 16507#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 16504#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 16501#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 16500#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 16499#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 16498#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 16497#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 16496#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 16495#L80-2 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; 16493#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 16492#L84 assume !(0 == mp_add_~i~0#1 % 256); 16490#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 16489#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 16487#L86-1 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; 16484#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 16480#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 16478#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 16476#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 16474#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 16472#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 16470#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 16468#L80-2 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; 16464#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 16460#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 16458#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 16457#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 16456#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 16455#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 16454#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 16453#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 16452#L80-2 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; 16450#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 16449#L84 assume !(0 == mp_add_~i~0#1 % 256); 16448#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 16447#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 16446#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 16445#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 16443#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 16442#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 16441#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 16440#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 16439#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 16438#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 16437#L80-2 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; 16422#L83 [2021-12-16 09:32:50,196 INFO L793 eck$LassoCheckResult]: Loop: 16422#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 16435#L84 assume !(0 == mp_add_~i~0#1 % 256); 16434#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 16433#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 16432#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 16430#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 16428#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 16427#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 16426#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 16425#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 16424#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 16423#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 16421#L80-2 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; 16422#L83 [2021-12-16 09:32:50,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash 645694645, now seen corresponding path program 1 times [2021-12-16 09:32:50,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:50,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727990038] [2021-12-16 09:32:50,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:50,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 41 proven. 26 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-12-16 09:32:50,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:50,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727990038] [2021-12-16 09:32:50,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727990038] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:50,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559790232] [2021-12-16 09:32:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:50,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:50,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:50,373 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:50,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-16 09:32:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:50,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 09:32:50,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 62 proven. 21 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-12-16 09:32:50,940 INFO L328 TraceCheckSpWp]: Computing backward predicates...