./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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.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 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 14:34:53,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:34:53,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:34:53,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:34:53,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:34:53,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:34:53,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:34:53,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:34:53,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:34:53,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:34:53,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:34:53,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:34:53,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:34:53,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:34:53,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:34:53,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:34:53,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:34:53,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:34:53,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:34:53,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:34:53,085 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:34:53,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:34:53,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:34:53,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:34:53,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:34:53,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:34:53,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:34:53,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:34:53,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:34:53,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:34:53,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:34:53,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:34:53,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:34:53,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:34:53,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:34:53,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:34:53,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:34:53,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:34:53,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:34:53,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:34:53,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:34:53,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:34:53,098 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 14:34:53,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:34:53,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:34:53,114 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:34:53,114 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:34:53,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:34:53,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:34:53,116 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:34:53,116 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:34:53,116 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:34:53,117 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:34:53,117 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:34:53,117 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:34:53,118 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:34:53,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:34:53,118 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 14:34:53,118 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:34:53,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:34:53,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 14:34:53,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:34:53,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:34:53,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:34:53,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:34:53,120 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 14:34:53,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:34:53,120 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:34:53,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:34:53,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:34:53,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:34:53,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:34:53,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:34:53,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:34:53,123 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:34:53,123 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 -> 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 [2022-07-23 14:34:53,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:34:53,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:34:53,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:34:53,367 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:34:53,367 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:34:53,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-1.i [2022-07-23 14:34:53,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15eb347cf/19e7f165398147a9b27e5d58f318781f/FLAG30bffe12c [2022-07-23 14:34:53,774 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:34:53,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i [2022-07-23 14:34:53,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15eb347cf/19e7f165398147a9b27e5d58f318781f/FLAG30bffe12c [2022-07-23 14:34:53,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15eb347cf/19e7f165398147a9b27e5d58f318781f [2022-07-23 14:34:53,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:34:53,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:34:53,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:34:53,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:34:53,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:34:53,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:34:53" (1/1) ... [2022-07-23 14:34:53,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fd840e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:53, skipping insertion in model container [2022-07-23 14:34:53,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:34:53" (1/1) ... [2022-07-23 14:34:53,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:34:53,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:34:53,967 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.i[1166,1179] [2022-07-23 14:34:54,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:34:54,022 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:34:54,032 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.i[1166,1179] [2022-07-23 14:34:54,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:34:54,067 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:34:54,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:54 WrapperNode [2022-07-23 14:34:54,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:34:54,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:34:54,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:34:54,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:34:54,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:54" (1/1) ... [2022-07-23 14:34:54,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:54" (1/1) ... [2022-07-23 14:34:54,138 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 146 [2022-07-23 14:34:54,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:34:54,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:34:54,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:34:54,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:34:54,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:54" (1/1) ... [2022-07-23 14:34:54,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:54" (1/1) ... [2022-07-23 14:34:54,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:54" (1/1) ... [2022-07-23 14:34:54,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:54" (1/1) ... [2022-07-23 14:34:54,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:54" (1/1) ... [2022-07-23 14:34:54,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:54" (1/1) ... [2022-07-23 14:34:54,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:54" (1/1) ... [2022-07-23 14:34:54,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:34:54,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:34:54,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:34:54,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:34:54,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:54" (1/1) ... [2022-07-23 14:34:54,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:54,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:54,244 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) [2022-07-23 14:34:54,262 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 [2022-07-23 14:34:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 14:34:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 14:34:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:34:54,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:34:54,328 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:34:54,329 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:34:54,814 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:34:54,821 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:34:54,823 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 14:34:54,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:34:54 BoogieIcfgContainer [2022-07-23 14:34:54,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:34:54,829 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:34:54,829 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:34:54,833 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:34:54,835 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:34:54,835 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:34:53" (1/3) ... [2022-07-23 14:34:54,836 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23439867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:34:54, skipping insertion in model container [2022-07-23 14:34:54,836 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:34:54,836 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:54" (2/3) ... [2022-07-23 14:34:54,837 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23439867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:34:54, skipping insertion in model container [2022-07-23 14:34:54,837 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:34:54,837 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:34:54" (3/3) ... [2022-07-23 14:34:54,838 INFO L354 chiAutomizerObserver]: Analyzing ICFG byte_add-1.i [2022-07-23 14:34:54,882 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:34:54,882 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:34:54,882 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:34:54,882 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:34:54,882 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:34:54,882 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:34:54,883 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:34:54,883 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:34:54,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 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) [2022-07-23 14:34:54,906 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-23 14:34:54,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:54,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:54,912 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:34:54,912 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:54,912 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:34:54,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 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) [2022-07-23 14:34:54,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-23 14:34:54,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:54,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:54,920 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:34:54,920 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:54,926 INFO L752 eck$LassoCheckResult]: Stem: 41#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(13, 2); 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 29#L59true assume !(0 == mp_add_~a3~0#1 % 256); 11#L59-1true mp_add_~nb~0#1 := 4; 12#L69true assume !(0 == mp_add_~b3~0#1 % 256); 48#L69-1true mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 14#L80-2true [2022-07-23 14:34:54,927 INFO L754 eck$LassoCheckResult]: Loop: 14#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; 21#L83true assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 50#L83-1true assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6#L89true assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 28#L95-1true assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 38#L99-1true assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 8#L100-1true assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 15#L101-1true assume !(3 == mp_add_~i~0#1 % 256); 16#L102-1true mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14#L80-2true [2022-07-23 14:34:54,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2022-07-23 14:34:54,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:54,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840954984] [2022-07-23 14:34:54,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:54,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:55,042 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:55,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:55,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:55,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1026291578, now seen corresponding path program 1 times [2022-07-23 14:34:55,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:55,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610701443] [2022-07-23 14:34:55,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:55,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:55,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:55,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610701443] [2022-07-23 14:34:55,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610701443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:34:55,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:34:55,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:34:55,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723131917] [2022-07-23 14:34:55,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:34:55,180 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:34:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:55,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:34:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:34:55,209 INFO L87 Difference]: Start difference. First operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 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) 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) [2022-07-23 14:34:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:55,352 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2022-07-23 14:34:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:34:55,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 114 transitions. [2022-07-23 14:34:55,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-07-23 14:34:55,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 66 states and 98 transitions. [2022-07-23 14:34:55,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2022-07-23 14:34:55,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-07-23 14:34:55,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 98 transitions. [2022-07-23 14:34:55,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:34:55,371 INFO L369 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2022-07-23 14:34:55,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 98 transitions. [2022-07-23 14:34:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-07-23 14:34:55,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.5) internal successors, (96), 63 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2022-07-23 14:34:55,399 INFO L392 hiAutomatonCegarLoop]: Abstraction has 64 states and 96 transitions. [2022-07-23 14:34:55,399 INFO L374 stractBuchiCegarLoop]: Abstraction has 64 states and 96 transitions. [2022-07-23 14:34:55,399 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:34:55,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 96 transitions. [2022-07-23 14:34:55,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-23 14:34:55,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:55,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:55,406 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:55,406 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:55,406 INFO L752 eck$LassoCheckResult]: Stem: 163#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(13, 2); 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 139#L59 assume !(0 == mp_add_~a3~0#1 % 256); 140#L59-1 mp_add_~nb~0#1 := 4; 159#L69 assume !(0 == mp_add_~b3~0#1 % 256); 149#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 165#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; 166#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 194#L83-1 [2022-07-23 14:34:55,406 INFO L754 eck$LassoCheckResult]: Loop: 194#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 138#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 144#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 181#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 184#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 172#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 173#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 174#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; 179#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 180#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; 162#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 168#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 169#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 194#L83-1 [2022-07-23 14:34:55,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:55,407 INFO L85 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2022-07-23 14:34:55,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:55,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484075812] [2022-07-23 14:34:55,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:55,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:55,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:55,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484075812] [2022-07-23 14:34:55,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484075812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:34:55,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:34:55,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 14:34:55,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811901378] [2022-07-23 14:34:55,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:34:55,537 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:55,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:55,537 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 1 times [2022-07-23 14:34:55,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:55,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472252032] [2022-07-23 14:34:55,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:55,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:55,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:55,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472252032] [2022-07-23 14:34:55,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472252032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:34:55,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:34:55,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:34:55,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203602557] [2022-07-23 14:34:55,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:34:55,574 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:34:55,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:55,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 14:34:55,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 14:34:55,575 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. cyclomatic complexity: 34 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2022-07-23 14:34:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:55,897 INFO L93 Difference]: Finished difference Result 222 states and 310 transitions. [2022-07-23 14:34:55,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 14:34:55,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 310 transitions. [2022-07-23 14:34:55,900 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 147 [2022-07-23 14:34:55,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 310 transitions. [2022-07-23 14:34:55,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2022-07-23 14:34:55,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2022-07-23 14:34:55,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 310 transitions. [2022-07-23 14:34:55,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:34:55,904 INFO L369 hiAutomatonCegarLoop]: Abstraction has 222 states and 310 transitions. [2022-07-23 14:34:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 310 transitions. [2022-07-23 14:34:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 79. [2022-07-23 14:34:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 78 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2022-07-23 14:34:55,909 INFO L392 hiAutomatonCegarLoop]: Abstraction has 79 states and 114 transitions. [2022-07-23 14:34:55,909 INFO L374 stractBuchiCegarLoop]: Abstraction has 79 states and 114 transitions. [2022-07-23 14:34:55,909 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:34:55,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 114 transitions. [2022-07-23 14:34:55,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-23 14:34:55,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:55,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:55,920 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:55,920 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:55,921 INFO L752 eck$LassoCheckResult]: Stem: 470#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(13, 2); 458#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 442#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 444#L61 assume !(0 == mp_add_~a2~0#1 % 256); 445#L59-1 mp_add_~nb~0#1 := 4; 495#L69 assume !(0 == mp_add_~b3~0#1 % 256); 490#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 491#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; 496#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 460#L83-1 [2022-07-23 14:34:55,921 INFO L754 eck$LassoCheckResult]: Loop: 460#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 447#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 449#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 466#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 455#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 456#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 477#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 480#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; 489#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 512#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; 469#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 474#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 459#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 460#L83-1 [2022-07-23 14:34:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash -384676570, now seen corresponding path program 1 times [2022-07-23 14:34:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:55,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590328741] [2022-07-23 14:34:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:56,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:56,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590328741] [2022-07-23 14:34:56,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590328741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:34:56,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:34:56,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 14:34:56,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916221058] [2022-07-23 14:34:56,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:34:56,004 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:56,005 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 2 times [2022-07-23 14:34:56,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:56,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638976139] [2022-07-23 14:34:56,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:56,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:56,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:56,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638976139] [2022-07-23 14:34:56,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638976139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:34:56,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:34:56,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:34:56,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424706440] [2022-07-23 14:34:56,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:34:56,037 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:34:56,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:56,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 14:34:56,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 14:34:56,038 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. cyclomatic complexity: 37 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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) [2022-07-23 14:34:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:56,621 INFO L93 Difference]: Finished difference Result 387 states and 549 transitions. [2022-07-23 14:34:56,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 14:34:56,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 549 transitions. [2022-07-23 14:34:56,626 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 279 [2022-07-23 14:34:56,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 387 states and 549 transitions. [2022-07-23 14:34:56,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 387 [2022-07-23 14:34:56,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 387 [2022-07-23 14:34:56,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 387 states and 549 transitions. [2022-07-23 14:34:56,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:34:56,638 INFO L369 hiAutomatonCegarLoop]: Abstraction has 387 states and 549 transitions. [2022-07-23 14:34:56,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states and 549 transitions. [2022-07-23 14:34:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 184. [2022-07-23 14:34:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 184 states have (on average 1.4076086956521738) internal successors, (259), 183 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 259 transitions. [2022-07-23 14:34:56,660 INFO L392 hiAutomatonCegarLoop]: Abstraction has 184 states and 259 transitions. [2022-07-23 14:34:56,660 INFO L374 stractBuchiCegarLoop]: Abstraction has 184 states and 259 transitions. [2022-07-23 14:34:56,660 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:34:56,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 259 transitions. [2022-07-23 14:34:56,661 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 113 [2022-07-23 14:34:56,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:56,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:56,663 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:56,663 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:56,664 INFO L752 eck$LassoCheckResult]: Stem: 967#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(13, 2); 952#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 934#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 936#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 938#L63 assume !(0 == mp_add_~a1~0#1 % 256); 939#L59-1 mp_add_~nb~0#1 := 4; 992#L69 assume !(0 == mp_add_~b3~0#1 % 256); 988#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 989#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; 1028#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1051#L83-1 [2022-07-23 14:34:56,664 INFO L754 eck$LassoCheckResult]: Loop: 1051#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1048#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 1043#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1039#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1037#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1033#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 986#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 987#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; 1030#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1058#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; 1056#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1055#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1053#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1051#L83-1 [2022-07-23 14:34:56,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2089936051, now seen corresponding path program 1 times [2022-07-23 14:34:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:56,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56801092] [2022-07-23 14:34:56,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:56,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:56,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:56,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56801092] [2022-07-23 14:34:56,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56801092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:34:56,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:34:56,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 14:34:56,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505242031] [2022-07-23 14:34:56,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:34:56,801 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 3 times [2022-07-23 14:34:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:56,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023185843] [2022-07-23 14:34:56,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:56,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:56,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:56,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023185843] [2022-07-23 14:34:56,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023185843] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:34:56,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:34:56,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:34:56,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163967054] [2022-07-23 14:34:56,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:34:56,861 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:34:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:56,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 14:34:56,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 14:34:56,862 INFO L87 Difference]: Start difference. First operand 184 states and 259 transitions. cyclomatic complexity: 79 Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:57,511 INFO L93 Difference]: Finished difference Result 482 states and 675 transitions. [2022-07-23 14:34:57,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 14:34:57,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 675 transitions. [2022-07-23 14:34:57,515 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 345 [2022-07-23 14:34:57,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 675 transitions. [2022-07-23 14:34:57,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2022-07-23 14:34:57,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2022-07-23 14:34:57,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 675 transitions. [2022-07-23 14:34:57,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:34:57,518 INFO L369 hiAutomatonCegarLoop]: Abstraction has 482 states and 675 transitions. [2022-07-23 14:34:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 675 transitions. [2022-07-23 14:34:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 270. [2022-07-23 14:34:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.4037037037037037) internal successors, (379), 269 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 379 transitions. [2022-07-23 14:34:57,526 INFO L392 hiAutomatonCegarLoop]: Abstraction has 270 states and 379 transitions. [2022-07-23 14:34:57,526 INFO L374 stractBuchiCegarLoop]: Abstraction has 270 states and 379 transitions. [2022-07-23 14:34:57,527 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:34:57,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 379 transitions. [2022-07-23 14:34:57,528 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 175 [2022-07-23 14:34:57,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:57,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:57,528 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:57,529 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:57,529 INFO L752 eck$LassoCheckResult]: Stem: 1665#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(13, 2); 1650#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 1631#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1633#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1635#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1636#L59-1 mp_add_~nb~0#1 := 4; 1693#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1689#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1690#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; 1817#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1850#L83-1 [2022-07-23 14:34:57,529 INFO L754 eck$LassoCheckResult]: Loop: 1850#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1847#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 1827#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1826#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1825#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1822#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1818#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1815#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; 1816#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1859#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; 1856#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1855#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1853#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1850#L83-1 [2022-07-23 14:34:57,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:57,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194353, now seen corresponding path program 1 times [2022-07-23 14:34:57,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:57,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381397070] [2022-07-23 14:34:57,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:57,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:57,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:57,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381397070] [2022-07-23 14:34:57,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381397070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:34:57,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:34:57,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 14:34:57,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229864092] [2022-07-23 14:34:57,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:34:57,605 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:57,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:57,605 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 4 times [2022-07-23 14:34:57,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:57,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555003670] [2022-07-23 14:34:57,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:57,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:57,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555003670] [2022-07-23 14:34:57,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555003670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:34:57,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:34:57,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:34:57,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478314343] [2022-07-23 14:34:57,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:34:57,650 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:34:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:57,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 14:34:57,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 14:34:57,652 INFO L87 Difference]: Start difference. First operand 270 states and 379 transitions. cyclomatic complexity: 115 Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:58,354 INFO L93 Difference]: Finished difference Result 370 states and 514 transitions. [2022-07-23 14:34:58,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 14:34:58,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 514 transitions. [2022-07-23 14:34:58,357 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 243 [2022-07-23 14:34:58,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 370 states and 514 transitions. [2022-07-23 14:34:58,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 370 [2022-07-23 14:34:58,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 370 [2022-07-23 14:34:58,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 370 states and 514 transitions. [2022-07-23 14:34:58,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:34:58,359 INFO L369 hiAutomatonCegarLoop]: Abstraction has 370 states and 514 transitions. [2022-07-23 14:34:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states and 514 transitions. [2022-07-23 14:34:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 304. [2022-07-23 14:34:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 304 states have (on average 1.4046052631578947) internal successors, (427), 303 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 427 transitions. [2022-07-23 14:34:58,365 INFO L392 hiAutomatonCegarLoop]: Abstraction has 304 states and 427 transitions. [2022-07-23 14:34:58,365 INFO L374 stractBuchiCegarLoop]: Abstraction has 304 states and 427 transitions. [2022-07-23 14:34:58,365 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:34:58,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 427 transitions. [2022-07-23 14:34:58,367 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-23 14:34:58,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:58,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:58,367 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:58,367 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:58,368 INFO L752 eck$LassoCheckResult]: Stem: 2331#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(13, 2); 2318#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 2305#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2307#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2309#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2310#L59-1 mp_add_~nb~0#1 := 4; 2327#L69 assume !(0 == mp_add_~b3~0#1 % 256); 2315#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 2346#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; 2345#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2328#L84 [2022-07-23 14:34:58,368 INFO L754 eck$LassoCheckResult]: Loop: 2328#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; 2329#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2334#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2319#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2320#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2300#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 2302#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 2326#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2312#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2313#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2338#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2349#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; 2556#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2328#L84 [2022-07-23 14:34:58,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 1 times [2022-07-23 14:34:58,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:58,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948823983] [2022-07-23 14:34:58,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:58,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:58,378 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:58,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:58,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:58,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1738393452, now seen corresponding path program 5 times [2022-07-23 14:34:58,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:58,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869336855] [2022-07-23 14:34:58,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:58,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:58,393 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:58,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:58,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:58,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1295002104, now seen corresponding path program 1 times [2022-07-23 14:34:58,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:58,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898308113] [2022-07-23 14:34:58,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:58,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:58,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:58,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898308113] [2022-07-23 14:34:58,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898308113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:34:58,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:34:58,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:34:58,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039586380] [2022-07-23 14:34:58,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:34:58,573 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:34:58,574 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:34:58,574 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:34:58,574 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:34:58,574 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 14:34:58,574 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:58,574 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:34:58,574 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:34:58,574 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration6_Loop [2022-07-23 14:34:58,575 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:34:58,575 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:34:58,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:58,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:58,793 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:34:58,794 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 14:34:58,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:58,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:58,816 INFO L229 MonitoredProcess]: Starting monitored process 2 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) [2022-07-23 14:34:58,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-23 14:34:58,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 14:34:58,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:34:58,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:58,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:58,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:58,916 INFO L229 MonitoredProcess]: Starting monitored process 3 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) [2022-07-23 14:34:58,932 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 14:34:58,932 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:34:58,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-23 14:34:59,585 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 14:34:59,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:59,591 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:34:59,591 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:34:59,591 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:34:59,591 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:34:59,591 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:34:59,591 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:59,591 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:34:59,591 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:34:59,591 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration6_Loop [2022-07-23 14:34:59,591 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:34:59,592 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:34:59,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:59,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:59,812 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:34:59,814 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:34:59,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:59,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:59,819 INFO L229 MonitoredProcess]: Starting monitored process 4 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) [2022-07-23 14:34:59,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-23 14:34:59,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:59,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:59,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:59,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:59,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:59,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:59,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:59,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:59,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:59,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:59,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:59,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:59,880 INFO L229 MonitoredProcess]: Starting monitored process 5 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) [2022-07-23 14:34:59,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:59,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:59,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:59,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:59,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:59,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:59,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:59,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:59,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-23 14:34:59,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:59,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:59,924 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-23 14:34:59,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:59,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:59,926 INFO L229 MonitoredProcess]: Starting monitored process 6 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) [2022-07-23 14:34:59,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-23 14:34:59,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:59,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:59,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:59,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:59,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:59,934 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:34:59,937 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:34:59,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:59,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:59,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:59,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:59,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:59,973 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2022-07-23 14:34:59,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-23 14:34:59,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:00,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,001 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:00,005 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:00,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,033 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-23 14:35:00,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,035 INFO L229 MonitoredProcess]: Starting monitored process 8 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) [2022-07-23 14:35:00,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-23 14:35:00,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:00,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,062 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:00,073 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:00,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,094 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2022-07-23 14:35:00,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-23 14:35:00,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:00,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,104 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:00,117 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:00,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,157 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-23 14:35:00,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,159 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2022-07-23 14:35:00,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-23 14:35:00,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:00,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,173 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:00,178 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:00,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,223 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2022-07-23 14:35:00,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:00,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,235 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:00,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-23 14:35:00,240 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:00,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,273 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-23 14:35:00,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,275 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2022-07-23 14:35:00,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-23 14:35:00,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,285 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:00,286 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:00,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,286 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:00,289 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:00,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,330 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2022-07-23 14:35:00,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-23 14:35:00,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,337 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:00,338 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:00,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,338 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:00,341 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:00,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,371 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-23 14:35:00,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,374 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2022-07-23 14:35:00,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-23 14:35:00,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,381 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:00,382 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:00,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,382 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:00,387 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:00,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,415 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2022-07-23 14:35:00,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-23 14:35:00,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,425 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:00,426 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:00,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,426 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:00,431 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:00,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-23 14:35:00,474 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-23 14:35:00,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,475 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2022-07-23 14:35:00,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-23 14:35:00,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,483 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:00,483 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:00,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,484 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:00,490 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:00,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,544 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2022-07-23 14:35:00,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-23 14:35:00,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,562 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:00,562 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:00,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,563 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:00,569 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:00,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,630 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-23 14:35:00,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,644 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2022-07-23 14:35:00,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-23 14:35:00,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,651 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:00,652 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:00,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,652 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:00,656 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:00,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,732 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2022-07-23 14:35:00,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-23 14:35:00,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,773 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:00,774 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:00,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,774 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:00,778 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:00,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,817 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-23 14:35:00,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,822 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2022-07-23 14:35:00,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-23 14:35:00,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,832 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:00,833 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:00,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,833 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:00,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:00,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,875 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2022-07-23 14:35:00,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:00,887 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:00,887 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:00,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:00,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:00,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:00,887 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:00,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:00,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:00,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-23 14:35:00,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:00,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:00,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:00,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:00,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:35:00,921 INFO L87 Difference]: Start difference. First operand 304 states and 427 transitions. cyclomatic complexity: 130 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:01,027 INFO L93 Difference]: Finished difference Result 621 states and 854 transitions. [2022-07-23 14:35:01,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:35:01,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 621 states and 854 transitions. [2022-07-23 14:35:01,030 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 424 [2022-07-23 14:35:01,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 621 states to 621 states and 854 transitions. [2022-07-23 14:35:01,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 621 [2022-07-23 14:35:01,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 621 [2022-07-23 14:35:01,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 621 states and 854 transitions. [2022-07-23 14:35:01,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:01,033 INFO L369 hiAutomatonCegarLoop]: Abstraction has 621 states and 854 transitions. [2022-07-23 14:35:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states and 854 transitions. [2022-07-23 14:35:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 328. [2022-07-23 14:35:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 328 states have (on average 1.375) internal successors, (451), 327 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 451 transitions. [2022-07-23 14:35:01,039 INFO L392 hiAutomatonCegarLoop]: Abstraction has 328 states and 451 transitions. [2022-07-23 14:35:01,039 INFO L374 stractBuchiCegarLoop]: Abstraction has 328 states and 451 transitions. [2022-07-23 14:35:01,039 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 14:35:01,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 451 transitions. [2022-07-23 14:35:01,041 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-23 14:35:01,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:01,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:01,041 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:01,041 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:01,041 INFO L752 eck$LassoCheckResult]: Stem: 3269#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(13, 2); 3254#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 3241#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3243#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3245#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3246#L59-1 mp_add_~nb~0#1 := 4; 3263#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 3250#L71 assume !(0 == mp_add_~b2~0#1 % 256); 3251#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 3286#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; 3284#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3265#L84 [2022-07-23 14:35:01,041 INFO L754 eck$LassoCheckResult]: Loop: 3265#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; 3266#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3560#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3559#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3548#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3238#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 3240#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 3288#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3547#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3533#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3396#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3394#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; 3395#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3265#L84 [2022-07-23 14:35:01,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:01,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2143364048, now seen corresponding path program 1 times [2022-07-23 14:35:01,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:01,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481219586] [2022-07-23 14:35:01,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:01,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:01,062 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:01,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:01,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1738393452, now seen corresponding path program 6 times [2022-07-23 14:35:01,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:01,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311998616] [2022-07-23 14:35:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:01,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:01,092 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:01,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:01,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1046711293, now seen corresponding path program 1 times [2022-07-23 14:35:01,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:01,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646571331] [2022-07-23 14:35:01,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:01,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:01,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:01,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:01,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646571331] [2022-07-23 14:35:01,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646571331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:01,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:01,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 14:35:01,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805287586] [2022-07-23 14:35:01,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:01,275 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:01,275 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:01,275 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:01,275 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:01,275 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 14:35:01,275 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:01,275 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:01,275 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:01,275 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration7_Loop [2022-07-23 14:35:01,275 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:01,275 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:01,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:01,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:01,500 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:01,500 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 14:35:01,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:01,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:01,501 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2022-07-23 14:35:01,515 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 14:35:01,515 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:01,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-23 14:35:01,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:01,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:01,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:01,570 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2022-07-23 14:35:01,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-23 14:35:01,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 14:35:01,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:03,168 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 14:35:03,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,173 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:03,174 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:03,174 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:03,174 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:03,174 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:35:03,174 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,174 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:03,174 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:03,174 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration7_Loop [2022-07-23 14:35:03,174 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:03,174 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:03,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:03,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:03,368 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:03,368 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:35:03,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,370 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2022-07-23 14:35:03,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-23 14:35:03,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:03,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:03,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:35:03,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,412 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2022-07-23 14:35:03,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-23 14:35:03,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:03,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:03,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:35:03,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,450 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-23 14:35:03,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,452 INFO L229 MonitoredProcess]: Starting monitored process 26 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) [2022-07-23 14:35:03,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-23 14:35:03,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:03,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,459 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:03,461 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:03,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,495 INFO L229 MonitoredProcess]: Starting monitored process 27 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) [2022-07-23 14:35:03,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-23 14:35:03,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:03,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,502 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:03,505 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:03,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,537 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-23 14:35:03,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,538 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2022-07-23 14:35:03,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-23 14:35:03,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:03,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,546 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:03,552 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:03,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,585 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2022-07-23 14:35:03,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-23 14:35:03,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:03,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,593 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:03,596 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:03,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,629 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-23 14:35:03,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,630 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2022-07-23 14:35:03,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-23 14:35:03,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:03,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,638 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:03,641 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:03,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,664 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2022-07-23 14:35:03,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-23 14:35:03,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:03,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,672 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:03,677 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:03,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,708 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-23 14:35:03,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,710 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2022-07-23 14:35:03,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-23 14:35:03,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,717 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:03,718 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:03,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,718 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:03,721 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:03,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,750 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2022-07-23 14:35:03,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-23 14:35:03,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,757 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:03,757 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:03,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,758 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:03,761 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:03,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,787 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-23 14:35:03,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,788 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2022-07-23 14:35:03,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-23 14:35:03,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,795 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:03,796 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:03,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,796 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:03,800 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:03,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,832 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2022-07-23 14:35:03,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-23 14:35:03,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,839 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:03,839 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:03,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,840 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:03,844 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:03,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,878 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-23 14:35:03,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,879 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2022-07-23 14:35:03,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-23 14:35:03,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,887 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:03,887 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:03,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,887 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:03,892 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:03,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,925 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2022-07-23 14:35:03,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-23 14:35:03,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,933 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:03,933 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:03,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,933 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:03,938 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:03,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:03,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:03,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:03,975 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-23 14:35:03,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:03,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:03,976 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2022-07-23 14:35:03,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-23 14:35:03,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:03,982 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:03,983 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:03,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:03,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:03,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:03,983 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:03,986 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:03,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:04,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:04,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:04,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:04,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:04,018 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2022-07-23 14:35:04,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-23 14:35:04,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:04,025 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:04,025 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:04,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:04,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:04,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:04,026 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:04,029 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:04,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:04,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:04,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:04,072 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-23 14:35:04,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:04,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:04,073 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2022-07-23 14:35:04,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:04,081 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:04,081 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:04,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:04,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:04,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:04,081 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:04,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-23 14:35:04,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:04,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:04,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:04,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:04,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:04,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:04,127 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2022-07-23 14:35:04,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-23 14:35:04,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:04,134 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:04,135 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:04,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:04,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:04,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:04,135 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:04,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:04,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:04,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:04,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:04,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:04,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:35:04,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 14:35:04,190 INFO L87 Difference]: Start difference. First operand 328 states and 451 transitions. cyclomatic complexity: 130 Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:04,381 INFO L93 Difference]: Finished difference Result 946 states and 1289 transitions. [2022-07-23 14:35:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 14:35:04,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 946 states and 1289 transitions. [2022-07-23 14:35:04,387 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 636 [2022-07-23 14:35:04,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 946 states to 946 states and 1289 transitions. [2022-07-23 14:35:04,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946 [2022-07-23 14:35:04,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946 [2022-07-23 14:35:04,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1289 transitions. [2022-07-23 14:35:04,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:04,392 INFO L369 hiAutomatonCegarLoop]: Abstraction has 946 states and 1289 transitions. [2022-07-23 14:35:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1289 transitions. [2022-07-23 14:35:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 328. [2022-07-23 14:35:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 328 states have (on average 1.375) internal successors, (451), 327 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 451 transitions. [2022-07-23 14:35:04,397 INFO L392 hiAutomatonCegarLoop]: Abstraction has 328 states and 451 transitions. [2022-07-23 14:35:04,397 INFO L374 stractBuchiCegarLoop]: Abstraction has 328 states and 451 transitions. [2022-07-23 14:35:04,397 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 14:35:04,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 451 transitions. [2022-07-23 14:35:04,399 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-23 14:35:04,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:04,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:04,399 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:04,399 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:04,400 INFO L752 eck$LassoCheckResult]: Stem: 4558#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(13, 2); 4543#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 4530#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4532#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4534#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4535#L59-1 mp_add_~nb~0#1 := 4; 4552#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 4554#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 4579#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 4580#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4846#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; 4576#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4577#L84 [2022-07-23 14:35:04,403 INFO L754 eck$LassoCheckResult]: Loop: 4577#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; 4844#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4842#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4841#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4839#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4837#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 4835#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 4827#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4834#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4566#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4567#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4596#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; 4597#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4577#L84 [2022-07-23 14:35:04,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:04,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2012081280, now seen corresponding path program 1 times [2022-07-23 14:35:04,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:04,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652789148] [2022-07-23 14:35:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:04,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:04,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:04,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:04,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1738393452, now seen corresponding path program 7 times [2022-07-23 14:35:04,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:04,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010126528] [2022-07-23 14:35:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:04,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:04,443 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:04,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:04,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:04,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2075550029, now seen corresponding path program 1 times [2022-07-23 14:35:04,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:04,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235186486] [2022-07-23 14:35:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:04,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235186486] [2022-07-23 14:35:04,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235186486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:04,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:04,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 14:35:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740628422] [2022-07-23 14:35:04,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:04,595 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:04,595 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:04,595 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:04,595 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:04,595 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 14:35:04,595 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:04,595 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:04,595 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:04,595 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration8_Loop [2022-07-23 14:35:04,595 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:04,596 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:04,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:04,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:04,794 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:04,794 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 14:35:04,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:04,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:04,796 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2022-07-23 14:35:04,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-23 14:35:04,798 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 14:35:04,798 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:04,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:04,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:04,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:04,846 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2022-07-23 14:35:04,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-23 14:35:04,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 14:35:04,848 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:05,602 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 14:35:05,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:05,606 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:05,606 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:05,606 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:05,606 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:05,606 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:35:05,607 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:05,607 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:05,607 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:05,607 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration8_Loop [2022-07-23 14:35:05,607 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:05,607 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:05,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:05,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:05,779 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:05,779 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:35:05,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:05,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:05,781 INFO L229 MonitoredProcess]: Starting monitored process 44 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) [2022-07-23 14:35:05,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-23 14:35:05,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:05,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:05,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:05,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:05,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:05,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:05,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:35:05,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:05,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:05,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-23 14:35:05,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:05,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:05,808 INFO L229 MonitoredProcess]: Starting monitored process 45 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) [2022-07-23 14:35:05,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-23 14:35:05,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:05,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:05,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:05,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:05,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:05,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:05,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:35:05,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:05,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:05,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-23 14:35:05,837 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-23 14:35:05,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:05,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:05,838 INFO L229 MonitoredProcess]: Starting monitored process 46 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) [2022-07-23 14:35:05,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-23 14:35:05,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:05,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:05,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:05,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:05,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:05,845 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:05,848 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:05,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:05,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:05,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-23 14:35:05,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:05,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:05,869 INFO L229 MonitoredProcess]: Starting monitored process 47 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) [2022-07-23 14:35:05,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-23 14:35:05,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:05,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:05,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:05,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:05,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:05,877 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:05,881 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:05,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:05,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:05,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-23 14:35:05,900 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-23 14:35:05,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:05,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:05,901 INFO L229 MonitoredProcess]: Starting monitored process 48 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) [2022-07-23 14:35:05,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-23 14:35:05,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:05,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:05,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:05,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:05,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:05,909 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:05,913 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:05,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:05,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:05,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:05,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:05,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:05,951 INFO L229 MonitoredProcess]: Starting monitored process 49 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) [2022-07-23 14:35:05,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-23 14:35:05,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:05,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:05,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:05,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:05,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:05,959 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:05,962 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:05,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:05,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:05,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:05,993 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-23 14:35:05,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:05,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:05,995 INFO L229 MonitoredProcess]: Starting monitored process 50 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) [2022-07-23 14:35:05,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-23 14:35:05,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:06,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:06,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:06,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:06,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:06,003 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:06,007 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:06,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:06,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:06,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:06,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:06,040 INFO L229 MonitoredProcess]: Starting monitored process 51 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) [2022-07-23 14:35:06,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:06,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:06,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:06,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:06,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:06,067 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:06,072 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:06,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:06,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-23 14:35:06,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:06,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:06,099 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-23 14:35:06,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:06,115 INFO L229 MonitoredProcess]: Starting monitored process 52 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) [2022-07-23 14:35:06,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-23 14:35:06,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:06,123 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:06,123 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:06,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:06,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:06,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:06,123 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:06,126 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:06,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:06,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:06,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:06,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:06,158 INFO L229 MonitoredProcess]: Starting monitored process 53 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) [2022-07-23 14:35:06,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-23 14:35:06,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:06,166 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:06,167 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:06,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:06,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:06,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:06,167 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:06,170 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:06,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:06,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:06,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:06,202 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-23 14:35:06,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:06,203 INFO L229 MonitoredProcess]: Starting monitored process 54 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) [2022-07-23 14:35:06,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:06,227 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:06,227 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:06,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:06,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:06,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:06,227 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:06,231 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:06,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:06,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-23 14:35:06,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:06,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:06,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:06,269 INFO L229 MonitoredProcess]: Starting monitored process 55 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) [2022-07-23 14:35:06,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-23 14:35:06,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:06,277 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:06,277 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:06,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:06,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:06,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:06,277 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:06,281 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:06,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:06,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:06,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:06,313 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-23 14:35:06,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:06,314 INFO L229 MonitoredProcess]: Starting monitored process 56 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) [2022-07-23 14:35:06,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-23 14:35:06,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:06,322 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:06,322 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:06,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:06,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:06,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:06,322 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:06,327 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:06,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:06,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:06,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:06,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:06,355 INFO L229 MonitoredProcess]: Starting monitored process 57 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) [2022-07-23 14:35:06,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-23 14:35:06,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:06,364 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:06,364 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:06,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:06,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:06,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:06,364 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:06,369 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:06,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:06,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:06,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:06,397 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-23 14:35:06,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:06,399 INFO L229 MonitoredProcess]: Starting monitored process 58 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) [2022-07-23 14:35:06,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-23 14:35:06,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:06,406 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:06,406 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:06,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:06,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:06,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:06,407 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:06,410 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:06,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:06,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:06,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:06,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:06,442 INFO L229 MonitoredProcess]: Starting monitored process 59 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) [2022-07-23 14:35:06,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:06,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-23 14:35:06,450 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:06,450 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:06,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:06,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:06,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:06,450 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:06,454 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:06,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:06,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:06,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:06,485 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-23 14:35:06,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:06,486 INFO L229 MonitoredProcess]: Starting monitored process 60 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) [2022-07-23 14:35:06,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-23 14:35:06,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:06,493 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:06,494 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:06,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:06,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:06,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:06,494 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:06,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:06,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:06,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:06,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:06,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:06,524 INFO L229 MonitoredProcess]: Starting monitored process 61 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) [2022-07-23 14:35:06,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-23 14:35:06,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:06,532 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:06,532 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:06,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:06,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:06,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:06,532 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:06,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:06,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:06,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:06,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-23 14:35:06,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:06,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 14:35:06,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 14:35:06,573 INFO L87 Difference]: Start difference. First operand 328 states and 451 transitions. cyclomatic complexity: 130 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) [2022-07-23 14:35:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:06,936 INFO L93 Difference]: Finished difference Result 1321 states and 1776 transitions. [2022-07-23 14:35:06,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 14:35:06,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1321 states and 1776 transitions. [2022-07-23 14:35:06,942 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 848 [2022-07-23 14:35:06,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1321 states to 1321 states and 1776 transitions. [2022-07-23 14:35:06,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1321 [2022-07-23 14:35:06,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1321 [2022-07-23 14:35:06,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1321 states and 1776 transitions. [2022-07-23 14:35:06,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:06,948 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1321 states and 1776 transitions. [2022-07-23 14:35:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states and 1776 transitions. [2022-07-23 14:35:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 301. [2022-07-23 14:35:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 301 states have (on average 1.398671096345515) internal successors, (421), 300 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 421 transitions. [2022-07-23 14:35:06,954 INFO L392 hiAutomatonCegarLoop]: Abstraction has 301 states and 421 transitions. [2022-07-23 14:35:06,954 INFO L374 stractBuchiCegarLoop]: Abstraction has 301 states and 421 transitions. [2022-07-23 14:35:06,954 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-23 14:35:06,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states and 421 transitions. [2022-07-23 14:35:06,956 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-23 14:35:06,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:06,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:06,956 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:06,956 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:06,956 INFO L752 eck$LassoCheckResult]: Stem: 6225#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(13, 2); 6211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 6193#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6195#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6197#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6198#L59-1 mp_add_~nb~0#1 := 4; 6220#L69 assume !(0 == mp_add_~b3~0#1 % 256); 6244#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 6227#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; 6228#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6242#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; 6245#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6229#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6230#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6246#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 6237#L90 [2022-07-23 14:35:06,957 INFO L754 eck$LassoCheckResult]: Loop: 6237#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; 6238#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 6200#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 6201#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 6202#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 6204#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 6221#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6208#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6209#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6234#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6332#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; 6333#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6223#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; 6224#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6493#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6212#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6213#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 6237#L90 [2022-07-23 14:35:06,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 1 times [2022-07-23 14:35:06,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:06,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224653674] [2022-07-23 14:35:06,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:06,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:06,973 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:06,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:06,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:06,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1188749690, now seen corresponding path program 1 times [2022-07-23 14:35:06,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:06,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407280641] [2022-07-23 14:35:06,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:06,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:07,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:07,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407280641] [2022-07-23 14:35:07,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407280641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:07,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:07,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:35:07,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641476956] [2022-07-23 14:35:07,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:07,016 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:07,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:07,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:35:07,017 INFO L87 Difference]: Start difference. First operand 301 states and 421 transitions. cyclomatic complexity: 127 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:07,121 INFO L93 Difference]: Finished difference Result 451 states and 642 transitions. [2022-07-23 14:35:07,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:35:07,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 451 states and 642 transitions. [2022-07-23 14:35:07,123 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 361 [2022-07-23 14:35:07,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 451 states to 450 states and 641 transitions. [2022-07-23 14:35:07,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 450 [2022-07-23 14:35:07,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 450 [2022-07-23 14:35:07,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 450 states and 641 transitions. [2022-07-23 14:35:07,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:07,126 INFO L369 hiAutomatonCegarLoop]: Abstraction has 450 states and 641 transitions. [2022-07-23 14:35:07,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states and 641 transitions. [2022-07-23 14:35:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 412. [2022-07-23 14:35:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 412 states have (on average 1.4029126213592233) internal successors, (578), 411 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 578 transitions. [2022-07-23 14:35:07,131 INFO L392 hiAutomatonCegarLoop]: Abstraction has 412 states and 578 transitions. [2022-07-23 14:35:07,131 INFO L374 stractBuchiCegarLoop]: Abstraction has 412 states and 578 transitions. [2022-07-23 14:35:07,132 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-23 14:35:07,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 412 states and 578 transitions. [2022-07-23 14:35:07,133 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 323 [2022-07-23 14:35:07,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:07,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:07,134 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:07,134 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:07,134 INFO L752 eck$LassoCheckResult]: Stem: 6986#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(13, 2); 6971#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 6952#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6954#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6956#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6957#L59-1 mp_add_~nb~0#1 := 4; 6983#L69 assume !(0 == mp_add_~b3~0#1 % 256); 6966#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 6988#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; 6989#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7002#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; 7345#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6990#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6972#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6973#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 6995#L90 [2022-07-23 14:35:07,134 INFO L754 eck$LassoCheckResult]: Loop: 6995#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; 6996#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 6959#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 6960#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 6961#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 7030#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 7031#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7058#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7059#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7053#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7054#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; 7303#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7304#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7347#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 7006#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7007#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 6968#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 6969#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6994#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7047#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; 7048#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6984#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; 6985#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 7005#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7344#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7343#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 6995#L90 [2022-07-23 14:35:07,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 2 times [2022-07-23 14:35:07,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:07,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33507898] [2022-07-23 14:35:07,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:07,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:07,141 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:07,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1293860767, now seen corresponding path program 1 times [2022-07-23 14:35:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:07,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324902159] [2022-07-23 14:35:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:07,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 14:35:07,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:07,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324902159] [2022-07-23 14:35:07,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324902159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:07,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:07,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:35:07,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744766570] [2022-07-23 14:35:07,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:07,173 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:07,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:07,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:35:07,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:35:07,173 INFO L87 Difference]: Start difference. First operand 412 states and 578 transitions. cyclomatic complexity: 173 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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) [2022-07-23 14:35:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:07,254 INFO L93 Difference]: Finished difference Result 536 states and 740 transitions. [2022-07-23 14:35:07,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:35:07,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 536 states and 740 transitions. [2022-07-23 14:35:07,257 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 447 [2022-07-23 14:35:07,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 536 states to 536 states and 740 transitions. [2022-07-23 14:35:07,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 536 [2022-07-23 14:35:07,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 536 [2022-07-23 14:35:07,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 536 states and 740 transitions. [2022-07-23 14:35:07,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:07,260 INFO L369 hiAutomatonCegarLoop]: Abstraction has 536 states and 740 transitions. [2022-07-23 14:35:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states and 740 transitions. [2022-07-23 14:35:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 482. [2022-07-23 14:35:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.392116182572614) internal successors, (671), 481 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 671 transitions. [2022-07-23 14:35:07,267 INFO L392 hiAutomatonCegarLoop]: Abstraction has 482 states and 671 transitions. [2022-07-23 14:35:07,267 INFO L374 stractBuchiCegarLoop]: Abstraction has 482 states and 671 transitions. [2022-07-23 14:35:07,267 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-23 14:35:07,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 671 transitions. [2022-07-23 14:35:07,269 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 393 [2022-07-23 14:35:07,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:07,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:07,270 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:07,270 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:07,271 INFO L752 eck$LassoCheckResult]: Stem: 7937#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(13, 2); 7925#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 7906#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 7908#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 7910#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 7911#L59-1 mp_add_~nb~0#1 := 4; 7992#L69 assume !(0 == mp_add_~b3~0#1 % 256); 7958#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 7959#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; 8203#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8201#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; 8200#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8188#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8182#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8176#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 8164#L90 [2022-07-23 14:35:07,272 INFO L754 eck$LassoCheckResult]: Loop: 8164#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; 8168#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 8166#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 8162#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 8158#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 8154#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 8153#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8152#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8151#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8150#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8149#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; 7953#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7954#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8193#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 8186#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8181#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 8179#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8177#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8175#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8174#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; 8172#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8171#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; 8170#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8169#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8167#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8163#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 8164#L90 [2022-07-23 14:35:07,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:07,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 3 times [2022-07-23 14:35:07,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:07,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359416292] [2022-07-23 14:35:07,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:07,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:07,280 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:07,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:07,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:07,301 INFO L85 PathProgramCache]: Analyzing trace with hash 900833757, now seen corresponding path program 1 times [2022-07-23 14:35:07,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:07,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672080818] [2022-07-23 14:35:07,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:07,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:07,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:07,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672080818] [2022-07-23 14:35:07,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672080818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:07,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:07,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:35:07,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594098393] [2022-07-23 14:35:07,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:07,360 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:07,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:07,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:35:07,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 14:35:07,361 INFO L87 Difference]: Start difference. First operand 482 states and 671 transitions. cyclomatic complexity: 195 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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) [2022-07-23 14:35:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:07,546 INFO L93 Difference]: Finished difference Result 965 states and 1310 transitions. [2022-07-23 14:35:07,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 14:35:07,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 965 states and 1310 transitions. [2022-07-23 14:35:07,550 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 833 [2022-07-23 14:35:07,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 965 states to 964 states and 1309 transitions. [2022-07-23 14:35:07,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 964 [2022-07-23 14:35:07,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 964 [2022-07-23 14:35:07,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 964 states and 1309 transitions. [2022-07-23 14:35:07,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:07,556 INFO L369 hiAutomatonCegarLoop]: Abstraction has 964 states and 1309 transitions. [2022-07-23 14:35:07,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states and 1309 transitions. [2022-07-23 14:35:07,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 723. [2022-07-23 14:35:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 723 states have (on average 1.3706777316735823) internal successors, (991), 722 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 991 transitions. [2022-07-23 14:35:07,567 INFO L392 hiAutomatonCegarLoop]: Abstraction has 723 states and 991 transitions. [2022-07-23 14:35:07,567 INFO L374 stractBuchiCegarLoop]: Abstraction has 723 states and 991 transitions. [2022-07-23 14:35:07,567 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-23 14:35:07,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 723 states and 991 transitions. [2022-07-23 14:35:07,569 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 628 [2022-07-23 14:35:07,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:07,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:07,570 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:07,571 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:07,571 INFO L752 eck$LassoCheckResult]: Stem: 9396#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(13, 2); 9384#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 9364#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 9366#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 9368#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 9369#L59-1 mp_add_~nb~0#1 := 4; 9698#L69 assume !(0 == mp_add_~b3~0#1 % 256); 9412#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 9413#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; 9782#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9781#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; 9780#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 9779#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 9778#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 9777#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9772#L90 [2022-07-23 14:35:07,571 INFO L754 eck$LassoCheckResult]: Loop: 9772#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; 9753#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 9773#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 9769#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 9770#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 9724#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 9725#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 9815#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 9814#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9813#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9812#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; 9811#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 9810#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 9785#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 9723#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 9720#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 9721#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 9787#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9752#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9749#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; 9745#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9746#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; 9776#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 9775#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 9774#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 9771#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9772#L90 [2022-07-23 14:35:07,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 4 times [2022-07-23 14:35:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:07,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630453330] [2022-07-23 14:35:07,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:07,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:07,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:07,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:07,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:07,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1994925345, now seen corresponding path program 1 times [2022-07-23 14:35:07,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:07,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098907224] [2022-07-23 14:35:07,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:07,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:07,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:07,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098907224] [2022-07-23 14:35:07,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098907224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:07,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952641902] [2022-07-23 14:35:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:07,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:07,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:07,703 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:07,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-07-23 14:35:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:07,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 14:35:07,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:07,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:07,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952641902] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:07,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:07,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-07-23 14:35:07,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357420756] [2022-07-23 14:35:07,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:07,906 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:07,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:07,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 14:35:07,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-23 14:35:07,908 INFO L87 Difference]: Start difference. First operand 723 states and 991 transitions. cyclomatic complexity: 276 Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:08,154 INFO L93 Difference]: Finished difference Result 1229 states and 1633 transitions. [2022-07-23 14:35:08,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 14:35:08,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1229 states and 1633 transitions. [2022-07-23 14:35:08,159 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1055 [2022-07-23 14:35:08,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1229 states to 1229 states and 1633 transitions. [2022-07-23 14:35:08,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1229 [2022-07-23 14:35:08,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1229 [2022-07-23 14:35:08,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1229 states and 1633 transitions. [2022-07-23 14:35:08,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:08,166 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1229 states and 1633 transitions. [2022-07-23 14:35:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states and 1633 transitions. [2022-07-23 14:35:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1088. [2022-07-23 14:35:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1088 states have (on average 1.3446691176470589) internal successors, (1463), 1087 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1463 transitions. [2022-07-23 14:35:08,178 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1088 states and 1463 transitions. [2022-07-23 14:35:08,178 INFO L374 stractBuchiCegarLoop]: Abstraction has 1088 states and 1463 transitions. [2022-07-23 14:35:08,178 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-23 14:35:08,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1088 states and 1463 transitions. [2022-07-23 14:35:08,181 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 961 [2022-07-23 14:35:08,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:08,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:08,182 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:08,182 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:08,183 INFO L752 eck$LassoCheckResult]: Stem: 11512#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(13, 2); 11500#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 11481#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 11483#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 11485#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 11486#L59-1 mp_add_~nb~0#1 := 4; 12028#L69 assume !(0 == mp_add_~b3~0#1 % 256); 11533#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 11514#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; 11515#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 12216#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; 12215#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 12214#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 12213#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 12212#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 12192#L90 [2022-07-23 14:35:08,183 INFO L754 eck$LassoCheckResult]: Loop: 12192#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; 12070#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 12211#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 12209#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 12205#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 12056#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 12055#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 12054#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 12052#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 12047#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 12046#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; 12035#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 12036#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 12135#L90 assume !(0 == mp_add_~i~0#1 % 256); 12134#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; 12133#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 12131#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 12127#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 12125#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 12124#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 12123#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 12122#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 12121#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 12120#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; 12119#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 12075#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; 12203#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 12202#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 12201#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 12191#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 12192#L90 [2022-07-23 14:35:08,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 5 times [2022-07-23 14:35:08,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:08,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039640345] [2022-07-23 14:35:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:08,193 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:08,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:08,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:08,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1196420781, now seen corresponding path program 1 times [2022-07-23 14:35:08,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:08,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915714398] [2022-07-23 14:35:08,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:08,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 14:35:08,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:08,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915714398] [2022-07-23 14:35:08,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915714398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:08,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:08,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:35:08,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409649139] [2022-07-23 14:35:08,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:08,246 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:08,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:08,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:35:08,246 INFO L87 Difference]: Start difference. First operand 1088 states and 1463 transitions. cyclomatic complexity: 383 Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:08,353 INFO L93 Difference]: Finished difference Result 1450 states and 1886 transitions. [2022-07-23 14:35:08,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:35:08,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1450 states and 1886 transitions. [2022-07-23 14:35:08,359 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1308 [2022-07-23 14:35:08,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1450 states to 1449 states and 1883 transitions. [2022-07-23 14:35:08,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1449 [2022-07-23 14:35:08,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1449 [2022-07-23 14:35:08,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1449 states and 1883 transitions. [2022-07-23 14:35:08,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:08,389 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1449 states and 1883 transitions. [2022-07-23 14:35:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states and 1883 transitions. [2022-07-23 14:35:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1136. [2022-07-23 14:35:08,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1136 states have (on average 1.3195422535211268) internal successors, (1499), 1135 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:08,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1499 transitions. [2022-07-23 14:35:08,404 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1136 states and 1499 transitions. [2022-07-23 14:35:08,404 INFO L374 stractBuchiCegarLoop]: Abstraction has 1136 states and 1499 transitions. [2022-07-23 14:35:08,404 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-23 14:35:08,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1136 states and 1499 transitions. [2022-07-23 14:35:08,407 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1043 [2022-07-23 14:35:08,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:08,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:08,408 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:08,408 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-23 14:35:08,409 INFO L752 eck$LassoCheckResult]: Stem: 14063#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(13, 2); 14049#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 14029#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 14031#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 14033#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 14034#L59-1 mp_add_~nb~0#1 := 4; 14503#L69 assume !(0 == mp_add_~b3~0#1 % 256); 14084#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 14085#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; 14968#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14966#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; 14967#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 14951#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 14952#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 14941#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14940#L90 [2022-07-23 14:35:08,409 INFO L754 eck$LassoCheckResult]: Loop: 14940#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; 14838#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 14939#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 14934#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 14930#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 14928#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 14887#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14927#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14926#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14925#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14924#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; 14923#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 14921#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 14922#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 15020#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 15019#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 15018#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15017#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 15016#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15015#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; 15014#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 15013#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 14865#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 15000#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14795#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14796#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 14510#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14511#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14157#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; 14158#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14842#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; 14964#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 14965#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 14947#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 14948#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14940#L90 [2022-07-23 14:35:08,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:08,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 6 times [2022-07-23 14:35:08,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:08,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057802961] [2022-07-23 14:35:08,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:08,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:08,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:08,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:08,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:08,436 INFO L85 PathProgramCache]: Analyzing trace with hash -239832150, now seen corresponding path program 2 times [2022-07-23 14:35:08,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:08,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705660241] [2022-07-23 14:35:08,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:08,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:08,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:08,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705660241] [2022-07-23 14:35:08,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705660241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:08,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677498822] [2022-07-23 14:35:08,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:35:08,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:08,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:08,508 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:08,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-07-23 14:35:08,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 14:35:08,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:35:08,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 14:35:08,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-23 14:35:08,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 14:35:08,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677498822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:08,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 14:35:08,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-23 14:35:08,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725671457] [2022-07-23 14:35:08,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:08,586 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:08,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:08,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:08,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 14:35:08,586 INFO L87 Difference]: Start difference. First operand 1136 states and 1499 transitions. cyclomatic complexity: 369 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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) [2022-07-23 14:35:08,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:08,706 INFO L93 Difference]: Finished difference Result 1318 states and 1709 transitions. [2022-07-23 14:35:08,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:35:08,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1318 states and 1709 transitions. [2022-07-23 14:35:08,712 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1216 [2022-07-23 14:35:08,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1318 states to 1309 states and 1700 transitions. [2022-07-23 14:35:08,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1309 [2022-07-23 14:35:08,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1309 [2022-07-23 14:35:08,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1309 states and 1700 transitions. [2022-07-23 14:35:08,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:08,718 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1309 states and 1700 transitions. [2022-07-23 14:35:08,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states and 1700 transitions. [2022-07-23 14:35:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1226. [2022-07-23 14:35:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1226 states have (on average 1.3058727569331159) internal successors, (1601), 1225 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1601 transitions. [2022-07-23 14:35:08,732 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1226 states and 1601 transitions. [2022-07-23 14:35:08,732 INFO L374 stractBuchiCegarLoop]: Abstraction has 1226 states and 1601 transitions. [2022-07-23 14:35:08,732 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-23 14:35:08,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1226 states and 1601 transitions. [2022-07-23 14:35:08,736 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1135 [2022-07-23 14:35:08,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:08,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:08,737 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:08,737 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:08,737 INFO L752 eck$LassoCheckResult]: Stem: 16625#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(13, 2); 16613#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 16600#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 16602#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 16604#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 16605#L59-1 mp_add_~nb~0#1 := 4; 16737#L69 assume !(0 == mp_add_~b3~0#1 % 256); 16643#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 16629#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; 16630#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 17817#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; 17816#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 17815#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 17814#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 17773#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 17772#L90 [2022-07-23 14:35:08,737 INFO L754 eck$LassoCheckResult]: Loop: 17772#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; 17492#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 17771#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 17769#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 17763#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 17737#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 17478#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 17735#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 17734#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 16705#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 16695#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; 16696#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 17704#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 17703#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 17805#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 17804#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 17803#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 17802#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 17801#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 16697#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; 16698#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 17428#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 17421#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 17416#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 17417#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 16740#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 16741#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 17477#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 16650#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; 16651#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 17499#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; 17795#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 17794#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 17792#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 17789#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 17772#L90 [2022-07-23 14:35:08,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:08,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 7 times [2022-07-23 14:35:08,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:08,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378118733] [2022-07-23 14:35:08,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:08,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:08,745 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:08,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:08,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:08,755 INFO L85 PathProgramCache]: Analyzing trace with hash -632859160, now seen corresponding path program 2 times [2022-07-23 14:35:08,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:08,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504581682] [2022-07-23 14:35:08,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:08,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:08,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:08,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504581682] [2022-07-23 14:35:08,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504581682] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:08,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44728887] [2022-07-23 14:35:08,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:35:08,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:08,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:08,844 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:08,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-07-23 14:35:08,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 14:35:08,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:35:08,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 14:35:08,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 14:35:08,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 14:35:08,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44728887] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:08,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:08,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-07-23 14:35:08,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208814531] [2022-07-23 14:35:08,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:08,956 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:08,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:08,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 14:35:08,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-23 14:35:08,957 INFO L87 Difference]: Start difference. First operand 1226 states and 1601 transitions. cyclomatic complexity: 380 Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:09,899 INFO L93 Difference]: Finished difference Result 2029 states and 2515 transitions. [2022-07-23 14:35:09,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-23 14:35:09,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2029 states and 2515 transitions. [2022-07-23 14:35:09,907 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1839 [2022-07-23 14:35:09,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2029 states to 2000 states and 2477 transitions. [2022-07-23 14:35:09,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2000 [2022-07-23 14:35:09,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2000 [2022-07-23 14:35:09,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2000 states and 2477 transitions. [2022-07-23 14:35:09,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:09,915 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2000 states and 2477 transitions. [2022-07-23 14:35:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states and 2477 transitions. [2022-07-23 14:35:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1227. [2022-07-23 14:35:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1227 states have (on average 1.2828035859820701) internal successors, (1574), 1226 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1574 transitions. [2022-07-23 14:35:09,931 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1227 states and 1574 transitions. [2022-07-23 14:35:09,932 INFO L374 stractBuchiCegarLoop]: Abstraction has 1227 states and 1574 transitions. [2022-07-23 14:35:09,932 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-23 14:35:09,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1227 states and 1574 transitions. [2022-07-23 14:35:09,934 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1117 [2022-07-23 14:35:09,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:09,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:09,935 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:09,935 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:09,935 INFO L752 eck$LassoCheckResult]: Stem: 20209#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(13, 2); 20197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 20176#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 20178#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 20180#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 20181#L59-1 mp_add_~nb~0#1 := 4; 20585#L69 assume !(0 == mp_add_~b3~0#1 % 256); 20582#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 20581#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; 20580#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 20579#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; 20578#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 20577#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 20576#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 20574#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20550#L90 [2022-07-23 14:35:09,936 INFO L754 eck$LassoCheckResult]: Loop: 20550#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; 20570#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 20568#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 20566#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 20563#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 20564#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20571#L96-8 mp_add_~carry~0#1 := 1; 20569#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 20567#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20565#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20562#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20517#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20518#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; 20509#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20510#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20504#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 20501#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20499#L96-8 mp_add_~carry~0#1 := 1; 20497#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20494#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 20361#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20489#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20486#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20483#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; 20480#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20472#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20468#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 20469#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20470#L96-8 mp_add_~carry~0#1 := 1; 20467#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20462#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20460#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 20458#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20452#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20451#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; 20449#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20446#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20441#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 20442#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20440#L96-8 mp_add_~carry~0#1 := 1; 20438#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20436#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20426#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20422#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 20416#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20414#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; 20412#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20404#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20406#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 20386#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20383#L96-8 mp_add_~carry~0#1 := 1; 20377#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20378#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20366#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20363#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20352#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20351#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; 20334#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20335#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20421#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 20389#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20390#L96-8 mp_add_~carry~0#1 := 1; 20379#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20380#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20367#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20364#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20356#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20353#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; 20292#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20293#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20373#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 20374#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20435#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20434#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20432#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20431#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20428#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; 20429#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 20557#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; 20556#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 20553#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 20551#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 20549#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20550#L90 [2022-07-23 14:35:09,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:09,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 8 times [2022-07-23 14:35:09,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:09,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327169387] [2022-07-23 14:35:09,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:09,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:09,942 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:09,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:09,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:09,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1271323788, now seen corresponding path program 1 times [2022-07-23 14:35:09,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:09,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37266544] [2022-07-23 14:35:09,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:09,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-07-23 14:35:09,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:09,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37266544] [2022-07-23 14:35:09,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37266544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:09,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:09,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:35:09,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164424307] [2022-07-23 14:35:09,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:09,965 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:09,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:09,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:09,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:35:09,966 INFO L87 Difference]: Start difference. First operand 1227 states and 1574 transitions. cyclomatic complexity: 352 Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:10,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:10,008 INFO L93 Difference]: Finished difference Result 1542 states and 1876 transitions. [2022-07-23 14:35:10,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:35:10,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1542 states and 1876 transitions. [2022-07-23 14:35:10,013 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1259 [2022-07-23 14:35:10,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1542 states to 1398 states and 1732 transitions. [2022-07-23 14:35:10,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1398 [2022-07-23 14:35:10,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1398 [2022-07-23 14:35:10,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1398 states and 1732 transitions. [2022-07-23 14:35:10,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:10,019 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1398 states and 1732 transitions. [2022-07-23 14:35:10,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states and 1732 transitions. [2022-07-23 14:35:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1121. [2022-07-23 14:35:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1121 states have (on average 1.255129348795718) internal successors, (1407), 1120 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1407 transitions. [2022-07-23 14:35:10,032 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1121 states and 1407 transitions. [2022-07-23 14:35:10,032 INFO L374 stractBuchiCegarLoop]: Abstraction has 1121 states and 1407 transitions. [2022-07-23 14:35:10,032 INFO L287 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-23 14:35:10,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1121 states and 1407 transitions. [2022-07-23 14:35:10,035 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 996 [2022-07-23 14:35:10,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:10,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:10,035 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:10,035 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:10,035 INFO L752 eck$LassoCheckResult]: Stem: 22987#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(13, 2); 22973#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 22959#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 22961#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 22963#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 22964#L59-1 mp_add_~nb~0#1 := 4; 23278#L69 assume !(0 == mp_add_~b3~0#1 % 256); 23275#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 23274#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; 23273#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 23271#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; 23272#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 23267#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 23268#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 23263#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23262#L90 [2022-07-23 14:35:10,036 INFO L754 eck$LassoCheckResult]: Loop: 23262#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; 23261#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23260#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23258#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23253#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 23255#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 23248#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23249#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23244#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23245#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23240#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; 23241#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23237#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23236#L90 assume !(0 == mp_add_~i~0#1 % 256); 23235#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; 23131#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23231#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23228#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 23229#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 23230#L96-8 mp_add_~carry~0#1 := 1; 23227#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23225#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 23223#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23221#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23219#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23217#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; 23212#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23213#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 23216#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 23201#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23211#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23209#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 23207#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23205#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23187#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; 23188#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23183#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23181#L90 assume !(0 == mp_add_~i~0#1 % 256); 23179#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23176#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23168#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 23164#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 23160#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 23156#L96-8 mp_add_~carry~0#1 := 1; 23154#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23152#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23150#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23148#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 23116#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23146#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; 23145#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23143#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 23144#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 23956#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23954#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23139#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23138#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23105#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23137#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; 23135#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23136#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23132#L90 assume !(0 == mp_add_~i~0#1 % 256); 23130#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23129#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23127#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23124#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 23121#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 23120#L96-8 mp_add_~carry~0#1 := 1; 23119#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23118#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23117#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23115#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23114#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23113#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; 23112#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23110#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 23109#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 23108#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23107#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23106#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23104#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23103#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23032#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; 23033#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 23264#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; 23269#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 23270#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 23265#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 23266#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23262#L90 [2022-07-23 14:35:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:10,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 9 times [2022-07-23 14:35:10,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:10,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632291942] [2022-07-23 14:35:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:10,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:10,045 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:10,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:10,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1286195251, now seen corresponding path program 1 times [2022-07-23 14:35:10,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:10,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156669389] [2022-07-23 14:35:10,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:10,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-23 14:35:10,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:10,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156669389] [2022-07-23 14:35:10,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156669389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:10,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:10,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 14:35:10,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746577435] [2022-07-23 14:35:10,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:10,117 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:10,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:10,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 14:35:10,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 14:35:10,117 INFO L87 Difference]: Start difference. First operand 1121 states and 1407 transitions. cyclomatic complexity: 291 Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:10,381 INFO L93 Difference]: Finished difference Result 1741 states and 2153 transitions. [2022-07-23 14:35:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 14:35:10,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1741 states and 2153 transitions. [2022-07-23 14:35:10,386 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1451 [2022-07-23 14:35:10,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1741 states to 1712 states and 2122 transitions. [2022-07-23 14:35:10,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1712 [2022-07-23 14:35:10,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1712 [2022-07-23 14:35:10,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1712 states and 2122 transitions. [2022-07-23 14:35:10,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:10,393 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1712 states and 2122 transitions. [2022-07-23 14:35:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states and 2122 transitions. [2022-07-23 14:35:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1400. [2022-07-23 14:35:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1400 states have (on average 1.2635714285714286) internal successors, (1769), 1399 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1769 transitions. [2022-07-23 14:35:10,408 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1400 states and 1769 transitions. [2022-07-23 14:35:10,408 INFO L374 stractBuchiCegarLoop]: Abstraction has 1400 states and 1769 transitions. [2022-07-23 14:35:10,408 INFO L287 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-07-23 14:35:10,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1400 states and 1769 transitions. [2022-07-23 14:35:10,411 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1229 [2022-07-23 14:35:10,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:10,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:10,411 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:10,411 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:10,412 INFO L752 eck$LassoCheckResult]: Stem: 25873#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(13, 2); 25858#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 25844#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 25846#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 25848#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 25849#L59-1 mp_add_~nb~0#1 := 4; 26143#L69 assume !(0 == mp_add_~b3~0#1 % 256); 26140#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 26139#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; 26137#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 26138#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; 26134#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 26135#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 26131#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 26129#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26128#L90 [2022-07-23 14:35:10,412 INFO L754 eck$LassoCheckResult]: Loop: 26128#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; 26127#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26126#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26124#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26119#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 26121#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 26114#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26115#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26110#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26111#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26106#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; 26107#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26103#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26102#L90 assume !(0 == mp_add_~i~0#1 % 256); 26101#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; 26003#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26099#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26095#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 26092#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26091#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 26090#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26089#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26088#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26087#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; 26086#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26085#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26084#L90 assume !(0 == mp_add_~i~0#1 % 256); 26083#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26082#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; 26080#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26076#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 26074#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26072#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26070#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 26065#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26066#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26059#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; 26060#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26052#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26050#L90 assume !(0 == mp_add_~i~0#1 % 256); 26048#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26045#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26042#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 26038#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 26034#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 26030#L96-8 mp_add_~carry~0#1 := 1; 26028#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26026#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26024#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26022#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 25988#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26020#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; 26019#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26018#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 26015#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 26013#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26014#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26011#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26010#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 25977#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26009#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; 26007#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26008#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26004#L90 assume !(0 == mp_add_~i~0#1 % 256); 26002#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26001#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 25999#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 25996#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 25993#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 25992#L96-8 mp_add_~carry~0#1 := 1; 25991#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 25990#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 25989#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 25987#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 25986#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 25985#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; 25984#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 25982#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 25981#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 25980#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 25979#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 25978#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 25976#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 25975#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 25913#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; 25914#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 26130#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; 26136#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 26132#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 26133#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 27124#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26128#L90 [2022-07-23 14:35:10,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:10,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 10 times [2022-07-23 14:35:10,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:10,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587499639] [2022-07-23 14:35:10,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:10,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:10,418 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:10,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:10,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:10,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1983601108, now seen corresponding path program 1 times [2022-07-23 14:35:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:10,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511572089] [2022-07-23 14:35:10,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:10,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-23 14:35:10,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:10,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511572089] [2022-07-23 14:35:10,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511572089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:10,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:10,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:35:10,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260607486] [2022-07-23 14:35:10,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:10,447 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:10,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:10,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:35:10,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:35:10,448 INFO L87 Difference]: Start difference. First operand 1400 states and 1769 transitions. cyclomatic complexity: 376 Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:10,463 INFO L93 Difference]: Finished difference Result 1400 states and 1725 transitions. [2022-07-23 14:35:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:35:10,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1400 states and 1725 transitions. [2022-07-23 14:35:10,467 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1229 [2022-07-23 14:35:10,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1400 states to 1400 states and 1725 transitions. [2022-07-23 14:35:10,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1400 [2022-07-23 14:35:10,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1400 [2022-07-23 14:35:10,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1400 states and 1725 transitions. [2022-07-23 14:35:10,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:10,473 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1400 states and 1725 transitions. [2022-07-23 14:35:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states and 1725 transitions. [2022-07-23 14:35:10,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1400. [2022-07-23 14:35:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1400 states have (on average 1.2321428571428572) internal successors, (1725), 1399 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1725 transitions. [2022-07-23 14:35:10,486 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1400 states and 1725 transitions. [2022-07-23 14:35:10,487 INFO L374 stractBuchiCegarLoop]: Abstraction has 1400 states and 1725 transitions. [2022-07-23 14:35:10,487 INFO L287 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-07-23 14:35:10,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1400 states and 1725 transitions. [2022-07-23 14:35:10,489 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1229 [2022-07-23 14:35:10,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:10,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:10,490 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:10,490 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:10,490 INFO L752 eck$LassoCheckResult]: Stem: 28677#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(13, 2); 28665#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 28645#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 28647#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 28649#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 28650#L59-1 mp_add_~nb~0#1 := 4; 28958#L69 assume !(0 == mp_add_~b3~0#1 % 256); 28955#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 28954#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; 28952#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28953#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; 29848#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 28948#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 28949#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 28944#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28943#L90 [2022-07-23 14:35:10,490 INFO L754 eck$LassoCheckResult]: Loop: 28943#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; 28942#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28940#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28938#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28934#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 28936#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 28929#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28930#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28925#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28926#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28922#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; 28921#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28920#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28919#L90 assume !(0 == mp_add_~i~0#1 % 256); 28918#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; 28819#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28915#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28911#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 28913#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29955#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 29953#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29951#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29950#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29949#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; 29948#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28901#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28900#L90 assume !(0 == mp_add_~i~0#1 % 256); 28898#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28896#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; 28894#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28891#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 28889#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28887#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28885#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 28883#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28881#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28879#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; 28877#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28868#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28866#L90 assume !(0 == mp_add_~i~0#1 % 256); 28864#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28861#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28858#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 28855#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 28856#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28874#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28873#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28872#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 28871#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28870#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; 28869#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28867#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28865#L90 assume !(0 == mp_add_~i~0#1 % 256); 28863#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28860#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28857#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 28816#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 28814#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28828#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28827#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28826#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28792#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28825#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; 28823#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28824#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28820#L90 assume !(0 == mp_add_~i~0#1 % 256); 28818#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28817#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28815#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28813#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 28812#L96 assume !(0 == mp_add_~partial_sum~0#1); 28811#L96-2 assume !false; 28810#L96-4 assume !false; 28809#L96-6 assume !(mp_add_~partial_sum~0#1 >= 0);mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1; 28808#L96-8 mp_add_~carry~0#1 := 1; 28807#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28806#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28805#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28803#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28802#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28801#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; 28800#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28798#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 28797#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 28796#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28794#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28793#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28791#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28790#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28724#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; 28725#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28945#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; 28950#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 28951#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 28946#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 28947#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28943#L90 [2022-07-23 14:35:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:10,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 11 times [2022-07-23 14:35:10,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:10,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880443880] [2022-07-23 14:35:10,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:10,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:10,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:10,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:10,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1164629126, now seen corresponding path program 1 times [2022-07-23 14:35:10,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:10,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977636877] [2022-07-23 14:35:10,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:10,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-23 14:35:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977636877] [2022-07-23 14:35:10,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977636877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:10,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:10,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:35:10,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402248891] [2022-07-23 14:35:10,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:10,519 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:10,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:35:10,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:35:10,520 INFO L87 Difference]: Start difference. First operand 1400 states and 1725 transitions. cyclomatic complexity: 332 Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:10,561 INFO L93 Difference]: Finished difference Result 1512 states and 1843 transitions. [2022-07-23 14:35:10,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:35:10,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1512 states and 1843 transitions. [2022-07-23 14:35:10,565 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1341 [2022-07-23 14:35:10,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1512 states to 1512 states and 1843 transitions. [2022-07-23 14:35:10,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1512 [2022-07-23 14:35:10,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1512 [2022-07-23 14:35:10,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1512 states and 1843 transitions. [2022-07-23 14:35:10,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:10,571 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1512 states and 1843 transitions. [2022-07-23 14:35:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states and 1843 transitions. [2022-07-23 14:35:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1431. [2022-07-23 14:35:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1431 states have (on average 1.2313067784765899) internal successors, (1762), 1430 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1762 transitions. [2022-07-23 14:35:10,585 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1431 states and 1762 transitions. [2022-07-23 14:35:10,585 INFO L374 stractBuchiCegarLoop]: Abstraction has 1431 states and 1762 transitions. [2022-07-23 14:35:10,585 INFO L287 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-07-23 14:35:10,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1431 states and 1762 transitions. [2022-07-23 14:35:10,587 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1260 [2022-07-23 14:35:10,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:10,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:10,588 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:10,588 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:10,588 INFO L752 eck$LassoCheckResult]: Stem: 31598#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(13, 2); 31583#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 31569#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 31571#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 31573#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 31574#L59-1 mp_add_~nb~0#1 := 4; 31886#L69 assume !(0 == mp_add_~b3~0#1 % 256); 31883#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 31882#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; 31881#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 31879#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; 31880#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 31875#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 31876#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 31871#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31870#L90 [2022-07-23 14:35:10,588 INFO L754 eck$LassoCheckResult]: Loop: 31870#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; 31869#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31867#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31865#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31861#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 31863#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 31856#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31857#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32969#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32968#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31850#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; 31851#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31847#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31846#L90 assume !(0 == mp_add_~i~0#1 % 256); 31845#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; 31739#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31842#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31839#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 31835#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31836#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 31831#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31832#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32889#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32887#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; 32886#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31822#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31821#L90 assume !(0 == mp_add_~i~0#1 % 256); 31820#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31819#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; 31818#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31816#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 31814#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31812#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31810#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 31808#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31806#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31804#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; 31802#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31800#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31794#L90 assume !(0 == mp_add_~i~0#1 % 256); 31797#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31795#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31791#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 31792#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 31787#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31785#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31783#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31771#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 31770#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31767#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; 31768#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31764#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31762#L90 assume !(0 == mp_add_~i~0#1 % 256); 31763#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31756#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31757#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31782#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 31734#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31750#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31748#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31746#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31713#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31745#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; 31743#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31744#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31740#L90 assume !(0 == mp_add_~i~0#1 % 256); 31738#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31737#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31735#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31733#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 31732#L96 assume !(0 == mp_add_~partial_sum~0#1); 31731#L96-2 assume !false; 31730#L96-4 assume !false; 31729#L96-6 assume !(mp_add_~partial_sum~0#1 >= 0);mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1; 31728#L96-8 mp_add_~carry~0#1 := 1; 31727#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31726#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31725#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31723#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31722#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31721#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; 31720#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31718#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 31717#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 31716#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31715#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31714#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31712#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31711#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31626#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; 31627#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 31872#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; 31877#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 31878#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 31873#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 31874#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31870#L90 [2022-07-23 14:35:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 12 times [2022-07-23 14:35:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:10,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326897331] [2022-07-23 14:35:10,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:10,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:10,595 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:10,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:10,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1588275848, now seen corresponding path program 2 times [2022-07-23 14:35:10,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:10,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496571807] [2022-07-23 14:35:10,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 162 proven. 7 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-23 14:35:10,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:10,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496571807] [2022-07-23 14:35:10,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496571807] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:10,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004526403] [2022-07-23 14:35:10,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:35:10,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:10,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:10,623 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:10,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-07-23 14:35:10,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 14:35:10,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:35:10,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 14:35:10,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 162 proven. 7 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-23 14:35:10,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 162 proven. 7 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-23 14:35:10,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004526403] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:10,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:10,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-07-23 14:35:10,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650376462] [2022-07-23 14:35:10,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:10,743 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:10,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:10,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:35:10,743 INFO L87 Difference]: Start difference. First operand 1431 states and 1762 transitions. cyclomatic complexity: 338 Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:10,789 INFO L93 Difference]: Finished difference Result 708 states and 810 transitions. [2022-07-23 14:35:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:35:10,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 708 states and 810 transitions. [2022-07-23 14:35:10,791 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 424 [2022-07-23 14:35:10,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 708 states to 564 states and 661 transitions. [2022-07-23 14:35:10,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 564 [2022-07-23 14:35:10,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 564 [2022-07-23 14:35:10,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 564 states and 661 transitions. [2022-07-23 14:35:10,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:10,794 INFO L369 hiAutomatonCegarLoop]: Abstraction has 564 states and 661 transitions. [2022-07-23 14:35:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states and 661 transitions. [2022-07-23 14:35:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 461. [2022-07-23 14:35:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 461 states have (on average 1.1518438177874186) internal successors, (531), 460 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 531 transitions. [2022-07-23 14:35:10,806 INFO L392 hiAutomatonCegarLoop]: Abstraction has 461 states and 531 transitions. [2022-07-23 14:35:10,806 INFO L374 stractBuchiCegarLoop]: Abstraction has 461 states and 531 transitions. [2022-07-23 14:35:10,806 INFO L287 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-07-23 14:35:10,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 461 states and 531 transitions. [2022-07-23 14:35:10,807 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 321 [2022-07-23 14:35:10,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:10,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:10,808 INFO L179 hiAutomatonCegarLoop]: 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, 1, 1] [2022-07-23 14:35:10,808 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:10,808 INFO L752 eck$LassoCheckResult]: Stem: 34311#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(13, 2); 34299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 34287#L59 assume !(0 == mp_add_~a3~0#1 % 256); 34288#L59-1 mp_add_~nb~0#1 := 4; 34536#L69 assume !(0 == mp_add_~b3~0#1 % 256); 34533#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 34532#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; 34531#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34530#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; 34529#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34528#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34527#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34526#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34525#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; 34524#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34523#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34522#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34521#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 34520#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 34519#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34518#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34517#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34516#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34514#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; 34515#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34558#L84 assume !(0 == mp_add_~i~0#1 % 256); 34500#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; 34498#L85-1 [2022-07-23 14:35:10,808 INFO L754 eck$LassoCheckResult]: Loop: 34498#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34497#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34446#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34447#L90 assume !(0 == mp_add_~i~0#1 % 256); 34462#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; 34463#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34442#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34443#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 34434#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34435#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 34426#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34427#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34418#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34419#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; 34409#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 34411#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34494#L90 assume !(0 == mp_add_~i~0#1 % 256); 34577#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34576#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; 34575#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34574#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 34573#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34572#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34571#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 34570#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34569#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34568#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; 34566#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34565#L84 assume !(0 == mp_add_~i~0#1 % 256); 34564#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34563#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34562#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; 34552#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 34546#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 34553#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34549#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34544#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34539#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 34537#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34513#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; 34509#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34505#L84 assume !(0 == mp_add_~i~0#1 % 256); 34506#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; 34498#L85-1 [2022-07-23 14:35:10,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:10,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 1 times [2022-07-23 14:35:10,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:10,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734310752] [2022-07-23 14:35:10,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:10,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:10,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:10,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:10,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:10,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1729137940, now seen corresponding path program 1 times [2022-07-23 14:35:10,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:10,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738473517] [2022-07-23 14:35:10,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:10,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:10,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:10,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738473517] [2022-07-23 14:35:10,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738473517] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:10,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271108180] [2022-07-23 14:35:10,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:10,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:10,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:10,936 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:10,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-07-23 14:35:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:10,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 14:35:10,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:11,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 14:35:11,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271108180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:11,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 14:35:11,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-23 14:35:11,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944165960] [2022-07-23 14:35:11,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:11,054 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:11,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:11,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:35:11,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 14:35:11,055 INFO L87 Difference]: Start difference. First operand 461 states and 531 transitions. cyclomatic complexity: 76 Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:11,272 INFO L93 Difference]: Finished difference Result 771 states and 874 transitions. [2022-07-23 14:35:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 14:35:11,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 771 states and 874 transitions. [2022-07-23 14:35:11,274 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 520 [2022-07-23 14:35:11,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 771 states to 752 states and 855 transitions. [2022-07-23 14:35:11,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 752 [2022-07-23 14:35:11,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 752 [2022-07-23 14:35:11,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 752 states and 855 transitions. [2022-07-23 14:35:11,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:11,277 INFO L369 hiAutomatonCegarLoop]: Abstraction has 752 states and 855 transitions. [2022-07-23 14:35:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states and 855 transitions. [2022-07-23 14:35:11,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 463. [2022-07-23 14:35:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 463 states have (on average 1.1511879049676026) internal successors, (533), 462 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 533 transitions. [2022-07-23 14:35:11,284 INFO L392 hiAutomatonCegarLoop]: Abstraction has 463 states and 533 transitions. [2022-07-23 14:35:11,284 INFO L374 stractBuchiCegarLoop]: Abstraction has 463 states and 533 transitions. [2022-07-23 14:35:11,284 INFO L287 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-07-23 14:35:11,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 463 states and 533 transitions. [2022-07-23 14:35:11,285 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 318 [2022-07-23 14:35:11,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:11,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:11,286 INFO L179 hiAutomatonCegarLoop]: 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, 1, 1] [2022-07-23 14:35:11,286 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:11,286 INFO L752 eck$LassoCheckResult]: Stem: 35689#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(13, 2); 35679#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 35663#L59 assume !(0 == mp_add_~a3~0#1 % 256); 35664#L59-1 mp_add_~nb~0#1 := 4; 35684#L69 assume !(0 == mp_add_~b3~0#1 % 256); 35834#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 35835#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; 35830#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35831#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; 35826#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35827#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35822#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35823#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35818#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; 35819#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35814#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35815#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35810#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 35811#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 35806#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35807#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35802#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35803#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35796#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; 35797#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35966#L84 assume !(0 == mp_add_~i~0#1 % 256); 35789#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; 35790#L85-1 [2022-07-23 14:35:11,287 INFO L754 eck$LassoCheckResult]: Loop: 35790#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35781#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35782#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35787#L90 assume !(0 == mp_add_~i~0#1 % 256); 35788#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; 35779#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35780#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 36008#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 36007#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 36006#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 36005#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 36004#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 36003#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 36002#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; 36001#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 36000#L84 assume !(0 == mp_add_~i~0#1 % 256); 35999#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35998#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; 35997#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35995#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35994#L90 assume !(0 == mp_add_~i~0#1 % 256); 35993#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35992#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; 35991#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35990#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 35989#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35988#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35986#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 35983#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35980#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35977#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; 35968#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35969#L84 assume !(0 == mp_add_~i~0#1 % 256); 35972#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35956#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35945#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; 35946#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35924#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 35923#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35922#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35921#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35843#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 35839#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35840#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; 35793#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35794#L84 assume !(0 == mp_add_~i~0#1 % 256); 35964#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; 35790#L85-1 [2022-07-23 14:35:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 2 times [2022-07-23 14:35:11,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:11,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009588293] [2022-07-23 14:35:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:11,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:11,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2031036704, now seen corresponding path program 1 times [2022-07-23 14:35:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:11,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780295288] [2022-07-23 14:35:11,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:11,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:11,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:11,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780295288] [2022-07-23 14:35:11,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780295288] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:11,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136527259] [2022-07-23 14:35:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:11,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:11,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,388 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:11,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-07-23 14:35:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:11,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 14:35:11,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 14:35:11,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 14:35:11,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136527259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:11,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 14:35:11,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-23 14:35:11,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124412177] [2022-07-23 14:35:11,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:11,452 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:11,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:11,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:11,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-23 14:35:11,453 INFO L87 Difference]: Start difference. First operand 463 states and 533 transitions. cyclomatic complexity: 76 Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:11,538 INFO L93 Difference]: Finished difference Result 577 states and 657 transitions. [2022-07-23 14:35:11,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:35:11,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 577 states and 657 transitions. [2022-07-23 14:35:11,540 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 413 [2022-07-23 14:35:11,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 577 states to 523 states and 581 transitions. [2022-07-23 14:35:11,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 523 [2022-07-23 14:35:11,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 523 [2022-07-23 14:35:11,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 523 states and 581 transitions. [2022-07-23 14:35:11,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:11,542 INFO L369 hiAutomatonCegarLoop]: Abstraction has 523 states and 581 transitions. [2022-07-23 14:35:11,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states and 581 transitions. [2022-07-23 14:35:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 470. [2022-07-23 14:35:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 470 states have (on average 1.1191489361702127) internal successors, (526), 469 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 526 transitions. [2022-07-23 14:35:11,547 INFO L392 hiAutomatonCegarLoop]: Abstraction has 470 states and 526 transitions. [2022-07-23 14:35:11,547 INFO L374 stractBuchiCegarLoop]: Abstraction has 470 states and 526 transitions. [2022-07-23 14:35:11,547 INFO L287 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-07-23 14:35:11,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 470 states and 526 transitions. [2022-07-23 14:35:11,548 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 360 [2022-07-23 14:35:11,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:11,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:11,549 INFO L179 hiAutomatonCegarLoop]: 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, 1, 1] [2022-07-23 14:35:11,549 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:11,549 INFO L752 eck$LassoCheckResult]: Stem: 36880#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(13, 2); 36869#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 36852#L59 assume !(0 == mp_add_~a3~0#1 % 256); 36853#L59-1 mp_add_~nb~0#1 := 4; 37142#L69 assume !(0 == mp_add_~b3~0#1 % 256); 37139#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 37138#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; 37137#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37136#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; 37135#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37134#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37133#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37132#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 37131#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; 37130#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 37129#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 37128#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 37127#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 37126#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 37125#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37124#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37123#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37122#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37120#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; 37119#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37117#L84 assume !(0 == mp_add_~i~0#1 % 256); 37116#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; 37115#L85-1 [2022-07-23 14:35:11,549 INFO L754 eck$LassoCheckResult]: Loop: 37115#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37113#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37104#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 37105#L90 assume !(0 == mp_add_~i~0#1 % 256); 37110#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; 37108#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 37106#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 37102#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 37100#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37098#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 37096#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37094#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37092#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37090#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; 37087#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37085#L84 assume !(0 == mp_add_~i~0#1 % 256); 37083#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37081#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; 37079#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37077#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 37076#L90 assume !(0 == mp_add_~i~0#1 % 256); 37075#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 37074#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; 37071#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 37072#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 37067#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37068#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37063#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 37064#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37058#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37059#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; 37049#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37050#L84 assume !(0 == mp_add_~i~0#1 % 256); 37040#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37041#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37032#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; 37033#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37155#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 37175#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37174#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37173#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37172#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 37144#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37171#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; 37169#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37168#L84 assume !(0 == mp_add_~i~0#1 % 256); 37167#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37166#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37163#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37159#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37153#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 37151#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37149#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37147#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37145#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37121#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37056#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; 37057#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37047#L84 assume !(0 == mp_add_~i~0#1 % 256); 37048#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; 37115#L85-1 [2022-07-23 14:35:11,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:11,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 3 times [2022-07-23 14:35:11,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:11,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792454825] [2022-07-23 14:35:11,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:11,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:11,557 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:11,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:11,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:11,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1710168569, now seen corresponding path program 2 times [2022-07-23 14:35:11,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:11,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256383314] [2022-07-23 14:35:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:11,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:11,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256383314] [2022-07-23 14:35:11,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256383314] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:11,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895496572] [2022-07-23 14:35:11,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:35:11,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:11,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,644 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:11,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 14:35:11,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:35:11,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-07-23 14:35:11,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 14:35:11,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-23 14:35:11,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 14:35:11,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895496572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:11,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 14:35:11,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-07-23 14:35:11,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914492092] [2022-07-23 14:35:11,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:11,737 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:11,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:11,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:11,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 14:35:11,738 INFO L87 Difference]: Start difference. First operand 470 states and 526 transitions. cyclomatic complexity: 62 Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:11,808 INFO L93 Difference]: Finished difference Result 467 states and 514 transitions. [2022-07-23 14:35:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:35:11,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 467 states and 514 transitions. [2022-07-23 14:35:11,810 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 196 [2022-07-23 14:35:11,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 467 states to 467 states and 514 transitions. [2022-07-23 14:35:11,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 467 [2022-07-23 14:35:11,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 467 [2022-07-23 14:35:11,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 467 states and 514 transitions. [2022-07-23 14:35:11,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:11,812 INFO L369 hiAutomatonCegarLoop]: Abstraction has 467 states and 514 transitions. [2022-07-23 14:35:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states and 514 transitions. [2022-07-23 14:35:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 403. [2022-07-23 14:35:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 403 states have (on average 1.1017369727047146) internal successors, (444), 402 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 444 transitions. [2022-07-23 14:35:11,819 INFO L392 hiAutomatonCegarLoop]: Abstraction has 403 states and 444 transitions. [2022-07-23 14:35:11,820 INFO L374 stractBuchiCegarLoop]: Abstraction has 403 states and 444 transitions. [2022-07-23 14:35:11,820 INFO L287 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-07-23 14:35:11,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 403 states and 444 transitions. [2022-07-23 14:35:11,820 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 151 [2022-07-23 14:35:11,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:11,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:11,823 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:11,824 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-23 14:35:11,825 INFO L752 eck$LassoCheckResult]: Stem: 38008#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(13, 2); 37998#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 37986#L59 assume !(0 == mp_add_~a3~0#1 % 256); 37987#L59-1 mp_add_~nb~0#1 := 4; 38284#L69 assume !(0 == mp_add_~b3~0#1 % 256); 38280#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 38278#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; 38276#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38275#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; 38273#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38271#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38269#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38267#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38265#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; 38263#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38261#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38260#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38256#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38255#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 38251#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38250#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38249#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38248#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38247#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; 38246#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38245#L84 assume !(0 == mp_add_~i~0#1 % 256); 38244#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; 38242#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38240#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38237#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 38235#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38233#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38231#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 38229#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38227#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38225#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38223#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; 38220#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38218#L84 assume !(0 == mp_add_~i~0#1 % 256); 38216#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38214#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; 38210#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38202#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 38195#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38188#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38181#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38180#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 38176#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38175#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38173#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; 38171#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38168#L84 assume !(0 == mp_add_~i~0#1 % 256); 38164#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38165#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38156#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; 38157#L83-1 [2022-07-23 14:35:11,825 INFO L754 eck$LassoCheckResult]: Loop: 38157#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 38286#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38285#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38281#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38279#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38277#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 38179#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38274#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; 38272#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38270#L84 assume !(0 == mp_add_~i~0#1 % 256); 38268#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38266#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38264#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38041#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 38042#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38150#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38182#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38142#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38143#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38177#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38174#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; 38172#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38169#L84 assume !(0 == mp_add_~i~0#1 % 256); 38170#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38162#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38163#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; 38157#L83-1 [2022-07-23 14:35:11,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:11,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1143904857, now seen corresponding path program 1 times [2022-07-23 14:35:11,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:11,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752585464] [2022-07-23 14:35:11,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-23 14:35:11,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:11,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752585464] [2022-07-23 14:35:11,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752585464] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:11,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672310127] [2022-07-23 14:35:11,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:11,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:11,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,877 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:11,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-07-23 14:35:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:11,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 14:35:11,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 14:35:11,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 14:35:12,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672310127] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:12,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:12,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-07-23 14:35:12,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968342242] [2022-07-23 14:35:12,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:12,065 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:35:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:12,065 INFO L85 PathProgramCache]: Analyzing trace with hash -860927907, now seen corresponding path program 1 times [2022-07-23 14:35:12,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:12,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641062852] [2022-07-23 14:35:12,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:12,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:12,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:12,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641062852] [2022-07-23 14:35:12,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641062852] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:12,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110615504] [2022-07-23 14:35:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:12,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:12,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:12,103 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:12,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-07-23 14:35:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:12,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 14:35:12,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:12,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:12,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110615504] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:12,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:12,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-07-23 14:35:12,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901061007] [2022-07-23 14:35:12,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:12,292 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:12,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:12,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 14:35:12,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-07-23 14:35:12,293 INFO L87 Difference]: Start difference. First operand 403 states and 444 transitions. cyclomatic complexity: 46 Second operand has 13 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:12,664 INFO L93 Difference]: Finished difference Result 515 states and 560 transitions. [2022-07-23 14:35:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 14:35:12,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 515 states and 560 transitions. [2022-07-23 14:35:12,666 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 78 [2022-07-23 14:35:12,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 515 states to 513 states and 552 transitions. [2022-07-23 14:35:12,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 513 [2022-07-23 14:35:12,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 513 [2022-07-23 14:35:12,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 513 states and 552 transitions. [2022-07-23 14:35:12,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:12,695 INFO L369 hiAutomatonCegarLoop]: Abstraction has 513 states and 552 transitions. [2022-07-23 14:35:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states and 552 transitions. [2022-07-23 14:35:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 412. [2022-07-23 14:35:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 412 states have (on average 1.0728155339805825) internal successors, (442), 411 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 442 transitions. [2022-07-23 14:35:12,699 INFO L392 hiAutomatonCegarLoop]: Abstraction has 412 states and 442 transitions. [2022-07-23 14:35:12,699 INFO L374 stractBuchiCegarLoop]: Abstraction has 412 states and 442 transitions. [2022-07-23 14:35:12,699 INFO L287 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2022-07-23 14:35:12,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 412 states and 442 transitions. [2022-07-23 14:35:12,700 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 50 [2022-07-23 14:35:12,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:12,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:12,701 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:12,701 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:12,701 INFO L752 eck$LassoCheckResult]: Stem: 39445#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(13, 2); 39434#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 39422#L59 assume !(0 == mp_add_~a3~0#1 % 256); 39423#L59-1 mp_add_~nb~0#1 := 4; 39704#L69 assume !(0 == mp_add_~b3~0#1 % 256); 39701#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 39700#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; 39699#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39698#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; 39697#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39696#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39695#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39694#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39693#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; 39692#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39691#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39690#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39689#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39688#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 39687#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39686#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39685#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39684#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39683#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; 39682#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39681#L84 assume !(0 == mp_add_~i~0#1 % 256); 39680#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; 39679#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39677#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39674#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39669#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39670#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39661#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 39662#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39655#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39656#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39649#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; 39650#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39642#L84 assume !(0 == mp_add_~i~0#1 % 256); 39643#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39636#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; 39637#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39632#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39631#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39630#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39629#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39628#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 39627#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39626#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39625#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; 39624#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39623#L84 assume !(0 == mp_add_~i~0#1 % 256); 39622#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39621#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39620#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; 39619#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39618#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39617#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39616#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39615#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39614#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 39613#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39612#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; 39611#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39610#L84 assume !(0 == mp_add_~i~0#1 % 256); 39609#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39608#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39607#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39606#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39605#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39604#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39603#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39602#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39601#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39600#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39599#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; 39598#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39597#L84 assume !(0 == mp_add_~i~0#1 % 256); 39596#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39595#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39594#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39584#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39585#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39823#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39821#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39819#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39817#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39815#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39813#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; 39475#L83 [2022-07-23 14:35:12,701 INFO L754 eck$LassoCheckResult]: Loop: 39475#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39476#L84 assume !(0 == mp_add_~i~0#1 % 256); 39828#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39827#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39826#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39825#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39824#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39822#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39820#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39818#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39816#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39814#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39812#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; 39475#L83 [2022-07-23 14:35:12,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1357058734, now seen corresponding path program 1 times [2022-07-23 14:35:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:12,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745371992] [2022-07-23 14:35:12,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:12,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 91 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-23 14:35:12,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:12,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745371992] [2022-07-23 14:35:12,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745371992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:12,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540678570] [2022-07-23 14:35:12,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:12,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:12,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:12,772 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:12,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-07-23 14:35:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:12,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 14:35:12,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 111 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-23 14:35:13,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:46,441 WARN L233 SmtUtils]: Spent 32.83s on a formula simplification. DAG size of input: 6254 DAG size of output: 6192 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)