./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a92d749021b3b94f4ecd59f60bbcb6b80102c08a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 01:54:04,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 01:54:04,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 01:54:04,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 01:54:04,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 01:54:04,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 01:54:04,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 01:54:04,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 01:54:04,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 01:54:04,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 01:54:04,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 01:54:04,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 01:54:04,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 01:54:04,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 01:54:04,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 01:54:04,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 01:54:04,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 01:54:04,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 01:54:04,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 01:54:04,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 01:54:04,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 01:54:04,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 01:54:04,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 01:54:04,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 01:54:04,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 01:54:04,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 01:54:04,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 01:54:04,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 01:54:04,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 01:54:04,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 01:54:04,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 01:54:04,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 01:54:04,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 01:54:04,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 01:54:04,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 01:54:04,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 01:54:04,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 01:54:04,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 01:54:04,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 01:54:04,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 01:54:04,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 01:54:04,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 01:54:04,856 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 01:54:04,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 01:54:04,861 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 01:54:04,861 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 01:54:04,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 01:54:04,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 01:54:04,863 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 01:54:04,864 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 01:54:04,864 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 01:54:04,864 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 01:54:04,865 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 01:54:04,865 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 01:54:04,865 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 01:54:04,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 01:54:04,865 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 01:54:04,866 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 01:54:04,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 01:54:04,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 01:54:04,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 01:54:04,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 01:54:04,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 01:54:04,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 01:54:04,867 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 01:54:04,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 01:54:04,867 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 01:54:04,867 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 01:54:04,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 01:54:04,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 01:54:04,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 01:54:04,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 01:54:04,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 01:54:04,869 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 01:54:04,870 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 01:54:04,870 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 -> a92d749021b3b94f4ecd59f60bbcb6b80102c08a [2021-08-31 01:54:05,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 01:54:05,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 01:54:05,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 01:54:05,209 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 01:54:05,210 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 01:54:05,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-08-31 01:54:05,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f97736af/165c415b196c40bca45406c08df5c784/FLAG755042e6b [2021-08-31 01:54:05,707 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 01:54:05,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-08-31 01:54:05,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f97736af/165c415b196c40bca45406c08df5c784/FLAG755042e6b [2021-08-31 01:54:05,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f97736af/165c415b196c40bca45406c08df5c784 [2021-08-31 01:54:05,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 01:54:05,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 01:54:05,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 01:54:05,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 01:54:05,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 01:54:05,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:54:05" (1/1) ... [2021-08-31 01:54:05,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e62a0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:05, skipping insertion in model container [2021-08-31 01:54:05,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:54:05" (1/1) ... [2021-08-31 01:54:05,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 01:54:05,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 01:54:05,951 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[863,876] [2021-08-31 01:54:05,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 01:54:06,003 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 01:54:06,023 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[863,876] [2021-08-31 01:54:06,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 01:54:06,084 INFO L208 MainTranslator]: Completed translation [2021-08-31 01:54:06,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:06 WrapperNode [2021-08-31 01:54:06,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 01:54:06,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 01:54:06,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 01:54:06,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 01:54:06,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:06" (1/1) ... [2021-08-31 01:54:06,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:06" (1/1) ... [2021-08-31 01:54:06,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 01:54:06,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 01:54:06,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 01:54:06,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 01:54:06,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:06" (1/1) ... [2021-08-31 01:54:06,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:06" (1/1) ... [2021-08-31 01:54:06,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:06" (1/1) ... [2021-08-31 01:54:06,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:06" (1/1) ... [2021-08-31 01:54:06,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:06" (1/1) ... [2021-08-31 01:54:06,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:06" (1/1) ... [2021-08-31 01:54:06,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:06" (1/1) ... [2021-08-31 01:54:06,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 01:54:06,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 01:54:06,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 01:54:06,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 01:54:06,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:06" (1/1) ... [2021-08-31 01:54:06,198 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:54:06,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:54:06,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:54:06,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-31 01:54:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 01:54:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 01:54:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 01:54:06,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 01:54:06,502 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 01:54:06,503 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-31 01:54:06,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:54:06 BoogieIcfgContainer [2021-08-31 01:54:06,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 01:54:06,508 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 01:54:06,508 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 01:54:06,511 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 01:54:06,512 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 01:54:06,512 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 01:54:05" (1/3) ... [2021-08-31 01:54:06,513 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17430ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 01:54:06, skipping insertion in model container [2021-08-31 01:54:06,513 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 01:54:06,514 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:06" (2/3) ... [2021-08-31 01:54:06,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17430ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 01:54:06, skipping insertion in model container [2021-08-31 01:54:06,514 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 01:54:06,514 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:54:06" (3/3) ... [2021-08-31 01:54:06,516 INFO L389 chiAutomizerObserver]: Analyzing ICFG byte_add_1-1.i [2021-08-31 01:54:06,579 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 01:54:06,579 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 01:54:06,579 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 01:54:06,579 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 01:54:06,579 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 01:54:06,580 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 01:54:06,580 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 01:54:06,580 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 01:54:06,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:06,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-08-31 01:54:06,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:06,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:06,625 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 01:54:06,626 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:06,626 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 01:54:06,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:06,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-08-31 01:54:06,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:06,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:06,634 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 01:54:06,634 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:06,643 INFO L791 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 12#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 7#L51true assume !(0 == mp_add_~a3~0 % 256); 15#L51-1true mp_add_~nb~0 := 4; 8#L61true assume !(0 == mp_add_~b3~0 % 256); 18#L61-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 13#L72-2true [2021-08-31 01:54:06,643 INFO L793 eck$LassoCheckResult]: Loop: 13#L72-2true assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34#L75true assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36#L75-1true assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 27#L81true assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14#L87-1true assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 10#L91-1true assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 11#L92-1true assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 20#L93-1true assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 17#L94-1true mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 13#L72-2true [2021-08-31 01:54:06,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:06,655 INFO L82 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2021-08-31 01:54:06,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:06,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301169345] [2021-08-31 01:54:06,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:06,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:06,757 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:06,801 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:06,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:06,804 INFO L82 PathProgramCache]: Analyzing trace with hash 318197182, now seen corresponding path program 1 times [2021-08-31 01:54:06,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:06,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533993747] [2021-08-31 01:54:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:06,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:06,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:06,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533993747] [2021-08-31 01:54:06,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533993747] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:06,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:06,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 01:54:06,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061096767] [2021-08-31 01:54:06,903 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:06,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:06,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 01:54:06,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 01:54:06,931 INFO L87 Difference]: Start difference. First operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:07,161 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2021-08-31 01:54:07,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 01:54:07,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 94 transitions. [2021-08-31 01:54:07,170 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2021-08-31 01:54:07,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 56 states and 86 transitions. [2021-08-31 01:54:07,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-08-31 01:54:07,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-08-31 01:54:07,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 86 transitions. [2021-08-31 01:54:07,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:07,186 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 86 transitions. [2021-08-31 01:54:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 86 transitions. [2021-08-31 01:54:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2021-08-31 01:54:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 53 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 84 transitions. [2021-08-31 01:54:07,250 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-08-31 01:54:07,251 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-08-31 01:54:07,251 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 01:54:07,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 84 transitions. [2021-08-31 01:54:07,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-08-31 01:54:07,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:07,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:07,253 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:07,254 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:07,254 INFO L791 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 124#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 114#L51 assume !(0 == mp_add_~a3~0 % 256); 115#L51-1 mp_add_~nb~0 := 4; 117#L61 assume !(0 == mp_add_~b3~0 % 256); 118#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 125#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 126#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 146#L75-1 [2021-08-31 01:54:07,254 INFO L793 eck$LassoCheckResult]: Loop: 146#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 140#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 128#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 121#L91-1 assume !(1 == mp_add_~i~0 % 256); 122#L92-1 assume !(2 == mp_add_~i~0 % 256); 123#L93-1 assume !(3 == mp_add_~i~0 % 256); 131#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 132#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 158#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 159#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 151#L76-2 assume !(1 == mp_add_~i~0 % 256); 160#L77-1 assume !(2 == mp_add_~i~0 % 256); 145#L78-1 assume !(3 == mp_add_~i~0 % 256); 146#L75-1 [2021-08-31 01:54:07,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:07,255 INFO L82 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2021-08-31 01:54:07,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:07,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811224601] [2021-08-31 01:54:07,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:07,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:07,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:07,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811224601] [2021-08-31 01:54:07,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811224601] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:07,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:07,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 01:54:07,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545246989] [2021-08-31 01:54:07,506 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:54:07,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:07,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 1 times [2021-08-31 01:54:07,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:07,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123699174] [2021-08-31 01:54:07,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:07,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:07,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:07,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123699174] [2021-08-31 01:54:07,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123699174] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:07,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:07,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 01:54:07,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635216719] [2021-08-31 01:54:07,627 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:07,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:07,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 01:54:07,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-31 01:54:07,630 INFO L87 Difference]: Start difference. First operand 54 states and 84 transitions. cyclomatic complexity: 32 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:08,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:08,014 INFO L93 Difference]: Finished difference Result 149 states and 228 transitions. [2021-08-31 01:54:08,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 01:54:08,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 228 transitions. [2021-08-31 01:54:08,019 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2021-08-31 01:54:08,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 228 transitions. [2021-08-31 01:54:08,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2021-08-31 01:54:08,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2021-08-31 01:54:08,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 228 transitions. [2021-08-31 01:54:08,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:08,023 INFO L681 BuchiCegarLoop]: Abstraction has 149 states and 228 transitions. [2021-08-31 01:54:08,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 228 transitions. [2021-08-31 01:54:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 78. [2021-08-31 01:54:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2021-08-31 01:54:08,031 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-08-31 01:54:08,031 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-08-31 01:54:08,031 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 01:54:08,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 113 transitions. [2021-08-31 01:54:08,033 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-08-31 01:54:08,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:08,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:08,034 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:08,034 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:08,034 INFO L791 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 341#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 332#L51 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 334#L53 assume !(0 == mp_add_~a2~0 % 256); 368#L51-1 mp_add_~nb~0 := 4; 335#L61 assume !(0 == mp_add_~b3~0 % 256); 336#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 378#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 379#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 400#L75-1 [2021-08-31 01:54:08,034 INFO L793 eck$LassoCheckResult]: Loop: 400#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 366#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 342#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 329#L91-1 assume !(1 == mp_add_~i~0 % 256); 330#L92-1 assume !(2 == mp_add_~i~0 % 256); 331#L93-1 assume !(3 == mp_add_~i~0 % 256); 346#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 347#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 376#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 369#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 352#L76-2 assume !(1 == mp_add_~i~0 % 256); 353#L77-1 assume !(2 == mp_add_~i~0 % 256); 354#L78-1 assume !(3 == mp_add_~i~0 % 256); 400#L75-1 [2021-08-31 01:54:08,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:08,035 INFO L82 PathProgramCache]: Analyzing trace with hash -384676570, now seen corresponding path program 1 times [2021-08-31 01:54:08,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:08,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471634320] [2021-08-31 01:54:08,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:08,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:08,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:08,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471634320] [2021-08-31 01:54:08,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471634320] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:08,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:08,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 01:54:08,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062426682] [2021-08-31 01:54:08,078 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:54:08,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:08,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 2 times [2021-08-31 01:54:08,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:08,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685314997] [2021-08-31 01:54:08,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:08,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:08,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:08,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685314997] [2021-08-31 01:54:08,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685314997] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:08,148 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:08,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 01:54:08,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14348234] [2021-08-31 01:54:08,149 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:08,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:08,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 01:54:08,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 01:54:08,151 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. cyclomatic complexity: 37 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:08,210 INFO L93 Difference]: Finished difference Result 66 states and 93 transitions. [2021-08-31 01:54:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 01:54:08,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 93 transitions. [2021-08-31 01:54:08,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-08-31 01:54:08,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 93 transitions. [2021-08-31 01:54:08,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2021-08-31 01:54:08,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2021-08-31 01:54:08,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 93 transitions. [2021-08-31 01:54:08,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:08,224 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 93 transitions. [2021-08-31 01:54:08,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 93 transitions. [2021-08-31 01:54:08,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-08-31 01:54:08,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2021-08-31 01:54:08,239 INFO L704 BuchiCegarLoop]: Abstraction has 66 states and 93 transitions. [2021-08-31 01:54:08,239 INFO L587 BuchiCegarLoop]: Abstraction has 66 states and 93 transitions. [2021-08-31 01:54:08,239 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 01:54:08,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 93 transitions. [2021-08-31 01:54:08,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-08-31 01:54:08,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:08,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:08,241 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:08,241 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:08,242 INFO L791 eck$LassoCheckResult]: Stem: 500#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 490#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 481#L51 assume !(0 == mp_add_~a3~0 % 256); 482#L51-1 mp_add_~nb~0 := 4; 483#L61 assume !(0 == mp_add_~b3~0 % 256); 484#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 497#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 545#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 544#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 543#L76-2 assume !(1 == mp_add_~i~0 % 256); 541#L77-1 assume !(2 == mp_add_~i~0 % 256); 538#L78-1 assume !(3 == mp_add_~i~0 % 256); 533#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 531#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 493#L87-1 [2021-08-31 01:54:08,242 INFO L793 eck$LassoCheckResult]: Loop: 493#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 487#L91-1 assume !(1 == mp_add_~i~0 % 256); 488#L92-1 assume !(2 == mp_add_~i~0 % 256); 489#L93-1 assume !(3 == mp_add_~i~0 % 256); 498#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 522#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 523#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 514#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 517#L76-2 assume !(1 == mp_add_~i~0 % 256); 540#L77-1 assume !(2 == mp_add_~i~0 % 256); 537#L78-1 assume !(3 == mp_add_~i~0 % 256); 536#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 532#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 493#L87-1 [2021-08-31 01:54:08,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:08,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1874592092, now seen corresponding path program 1 times [2021-08-31 01:54:08,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:08,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219935828] [2021-08-31 01:54:08,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:08,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:08,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:08,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219935828] [2021-08-31 01:54:08,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219935828] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:08,380 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:08,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 01:54:08,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767732474] [2021-08-31 01:54:08,381 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:54:08,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:08,381 INFO L82 PathProgramCache]: Analyzing trace with hash 686981138, now seen corresponding path program 3 times [2021-08-31 01:54:08,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:08,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148046446] [2021-08-31 01:54:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:08,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:08,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:08,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148046446] [2021-08-31 01:54:08,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148046446] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:08,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:08,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 01:54:08,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147166945] [2021-08-31 01:54:08,468 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:08,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:08,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 01:54:08,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 01:54:08,469 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. cyclomatic complexity: 29 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:08,614 INFO L93 Difference]: Finished difference Result 91 states and 134 transitions. [2021-08-31 01:54:08,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 01:54:08,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 134 transitions. [2021-08-31 01:54:08,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2021-08-31 01:54:08,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 134 transitions. [2021-08-31 01:54:08,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2021-08-31 01:54:08,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2021-08-31 01:54:08,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 134 transitions. [2021-08-31 01:54:08,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:08,618 INFO L681 BuchiCegarLoop]: Abstraction has 91 states and 134 transitions. [2021-08-31 01:54:08,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 134 transitions. [2021-08-31 01:54:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2021-08-31 01:54:08,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 82 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2021-08-31 01:54:08,627 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 120 transitions. [2021-08-31 01:54:08,627 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 120 transitions. [2021-08-31 01:54:08,627 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 01:54:08,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 120 transitions. [2021-08-31 01:54:08,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2021-08-31 01:54:08,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:08,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:08,629 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:08,629 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:08,629 INFO L791 eck$LassoCheckResult]: Stem: 667#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 656#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 649#L51 assume !(0 == mp_add_~a3~0 % 256); 650#L51-1 mp_add_~nb~0 := 4; 651#L61 assume !(0 == mp_add_~b3~0 % 256); 652#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 663#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 711#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 710#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 709#L76-2 assume !(1 == mp_add_~i~0 % 256); 708#L77-1 assume !(2 == mp_add_~i~0 % 256); 706#L78-1 assume !(3 == mp_add_~i~0 % 256); 703#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 701#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 697#L87-1 [2021-08-31 01:54:08,629 INFO L793 eck$LassoCheckResult]: Loop: 697#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 696#L91-1 assume !(1 == mp_add_~i~0 % 256); 694#L92-1 assume !(2 == mp_add_~i~0 % 256); 691#L93-1 assume !(3 == mp_add_~i~0 % 256); 692#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 687#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 688#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 677#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 674#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 659#L87-1 assume !(0 == mp_add_~i~0 % 256); 655#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 647#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 648#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 689#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 690#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 695#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 715#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 716#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 676#L82-2 assume !(1 == mp_add_~i~0 % 256); 682#L83-1 assume !(2 == mp_add_~i~0 % 256); 684#L84-1 assume !(3 == mp_add_~i~0 % 256); 719#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 697#L87-1 [2021-08-31 01:54:08,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:08,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1874592092, now seen corresponding path program 2 times [2021-08-31 01:54:08,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:08,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112206171] [2021-08-31 01:54:08,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:08,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:08,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:08,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112206171] [2021-08-31 01:54:08,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112206171] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:08,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:08,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 01:54:08,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424310595] [2021-08-31 01:54:08,699 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:54:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:08,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1043280079, now seen corresponding path program 1 times [2021-08-31 01:54:08,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:08,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122817258] [2021-08-31 01:54:08,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:08,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-31 01:54:08,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:08,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122817258] [2021-08-31 01:54:08,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122817258] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:08,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:08,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 01:54:08,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238941728] [2021-08-31 01:54:08,720 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:08,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:08,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 01:54:08,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 01:54:08,721 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:08,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:08,911 INFO L93 Difference]: Finished difference Result 164 states and 234 transitions. [2021-08-31 01:54:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 01:54:08,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 234 transitions. [2021-08-31 01:54:08,913 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2021-08-31 01:54:08,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 164 states and 234 transitions. [2021-08-31 01:54:08,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2021-08-31 01:54:08,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2021-08-31 01:54:08,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 234 transitions. [2021-08-31 01:54:08,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:08,915 INFO L681 BuchiCegarLoop]: Abstraction has 164 states and 234 transitions. [2021-08-31 01:54:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 234 transitions. [2021-08-31 01:54:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 91. [2021-08-31 01:54:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2021-08-31 01:54:08,921 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2021-08-31 01:54:08,921 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2021-08-31 01:54:08,921 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 01:54:08,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 128 transitions. [2021-08-31 01:54:08,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2021-08-31 01:54:08,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:08,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:08,923 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:08,923 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:08,923 INFO L791 eck$LassoCheckResult]: Stem: 927#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 917#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 908#L51 assume !(0 == mp_add_~a3~0 % 256); 909#L51-1 mp_add_~nb~0 := 4; 910#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 912#L63 assume !(0 == mp_add_~b2~0 % 256); 913#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 970#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 969#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 968#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 967#L76-2 assume !(1 == mp_add_~i~0 % 256); 966#L77-1 assume !(2 == mp_add_~i~0 % 256); 965#L78-1 assume !(3 == mp_add_~i~0 % 256); 963#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 960#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 961#L87-1 [2021-08-31 01:54:08,923 INFO L793 eck$LassoCheckResult]: Loop: 961#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 904#L91-1 assume !(1 == mp_add_~i~0 % 256); 905#L92-1 assume !(2 == mp_add_~i~0 % 256); 955#L93-1 assume !(3 == mp_add_~i~0 % 256); 954#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 950#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 951#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 943#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 934#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 918#L87-1 assume !(0 == mp_add_~i~0 % 256); 919#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 906#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 907#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 924#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 952#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 953#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 982#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 983#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 938#L82-2 assume !(1 == mp_add_~i~0 % 256); 941#L83-1 assume !(2 == mp_add_~i~0 % 256); 991#L84-1 assume !(3 == mp_add_~i~0 % 256); 990#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 961#L87-1 [2021-08-31 01:54:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2095675795, now seen corresponding path program 1 times [2021-08-31 01:54:08,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:08,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779336872] [2021-08-31 01:54:08,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:08,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:09,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:09,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779336872] [2021-08-31 01:54:09,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779336872] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:09,047 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:09,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 01:54:09,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457581987] [2021-08-31 01:54:09,048 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:54:09,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:09,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1043280079, now seen corresponding path program 2 times [2021-08-31 01:54:09,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:09,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58212283] [2021-08-31 01:54:09,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:09,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-31 01:54:09,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:09,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58212283] [2021-08-31 01:54:09,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58212283] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:09,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:09,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 01:54:09,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692364816] [2021-08-31 01:54:09,083 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:09,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:09,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 01:54:09,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 01:54:09,090 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. cyclomatic complexity: 39 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:09,460 INFO L93 Difference]: Finished difference Result 245 states and 348 transitions. [2021-08-31 01:54:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 01:54:09,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 348 transitions. [2021-08-31 01:54:09,467 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2021-08-31 01:54:09,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 245 states and 348 transitions. [2021-08-31 01:54:09,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2021-08-31 01:54:09,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2021-08-31 01:54:09,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 348 transitions. [2021-08-31 01:54:09,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:09,469 INFO L681 BuchiCegarLoop]: Abstraction has 245 states and 348 transitions. [2021-08-31 01:54:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 348 transitions. [2021-08-31 01:54:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 91. [2021-08-31 01:54:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2021-08-31 01:54:09,479 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2021-08-31 01:54:09,479 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2021-08-31 01:54:09,479 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 01:54:09,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 128 transitions. [2021-08-31 01:54:09,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2021-08-31 01:54:09,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:09,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:09,481 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:09,481 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:09,481 INFO L791 eck$LassoCheckResult]: Stem: 1273#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 1264#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1256#L51 assume !(0 == mp_add_~a3~0 % 256); 1257#L51-1 mp_add_~nb~0 := 4; 1258#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1260#L63 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1261#L65 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1295#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1319#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1318#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1317#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1316#L76-2 assume !(1 == mp_add_~i~0 % 256); 1315#L77-1 assume !(2 == mp_add_~i~0 % 256); 1314#L78-1 assume !(3 == mp_add_~i~0 % 256); 1312#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1310#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1265#L87-1 [2021-08-31 01:54:09,481 INFO L793 eck$LassoCheckResult]: Loop: 1265#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1253#L91-1 assume !(1 == mp_add_~i~0 % 256); 1254#L92-1 assume !(2 == mp_add_~i~0 % 256); 1255#L93-1 assume !(3 == mp_add_~i~0 % 256); 1270#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1299#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1300#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1334#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1332#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1308#L87-1 assume !(0 == mp_add_~i~0 % 256); 1306#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 1304#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 1302#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 1301#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1297#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1298#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1281#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 1330#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 1283#L82-2 assume !(1 == mp_add_~i~0 % 256); 1343#L83-1 assume !(2 == mp_add_~i~0 % 256); 1286#L84-1 assume !(3 == mp_add_~i~0 % 256); 1280#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1265#L87-1 [2021-08-31 01:54:09,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:09,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1829134745, now seen corresponding path program 1 times [2021-08-31 01:54:09,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:09,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755969427] [2021-08-31 01:54:09,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:09,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:09,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:09,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755969427] [2021-08-31 01:54:09,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755969427] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:09,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:09,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 01:54:09,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088725257] [2021-08-31 01:54:09,532 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:54:09,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:09,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1043280079, now seen corresponding path program 3 times [2021-08-31 01:54:09,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:09,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195573838] [2021-08-31 01:54:09,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:09,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-31 01:54:09,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:09,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195573838] [2021-08-31 01:54:09,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195573838] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:09,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:09,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 01:54:09,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030958948] [2021-08-31 01:54:09,562 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:09,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:09,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 01:54:09,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-31 01:54:09,563 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. cyclomatic complexity: 39 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:09,767 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2021-08-31 01:54:09,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 01:54:09,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 318 transitions. [2021-08-31 01:54:09,770 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 177 [2021-08-31 01:54:09,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 219 states and 318 transitions. [2021-08-31 01:54:09,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2021-08-31 01:54:09,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2021-08-31 01:54:09,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 318 transitions. [2021-08-31 01:54:09,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:09,772 INFO L681 BuchiCegarLoop]: Abstraction has 219 states and 318 transitions. [2021-08-31 01:54:09,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 318 transitions. [2021-08-31 01:54:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 149. [2021-08-31 01:54:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 1.5033557046979866) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2021-08-31 01:54:09,778 INFO L704 BuchiCegarLoop]: Abstraction has 149 states and 224 transitions. [2021-08-31 01:54:09,778 INFO L587 BuchiCegarLoop]: Abstraction has 149 states and 224 transitions. [2021-08-31 01:54:09,778 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 01:54:09,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 224 transitions. [2021-08-31 01:54:09,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 113 [2021-08-31 01:54:09,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:09,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:09,780 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:09,780 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:09,780 INFO L791 eck$LassoCheckResult]: Stem: 1595#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 1587#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1579#L51 assume !(0 == mp_add_~a3~0 % 256); 1580#L51-1 mp_add_~nb~0 := 4; 1581#L61 assume !(0 == mp_add_~b3~0 % 256); 1582#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1585#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1586#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1625#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1626#L76-2 assume !(1 == mp_add_~i~0 % 256); 1653#L77-1 assume !(2 == mp_add_~i~0 % 256); 1652#L78-1 assume !(3 == mp_add_~i~0 % 256); 1651#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 1645#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 1648#L82-2 assume !(1 == mp_add_~i~0 % 256); 1646#L83-1 assume !(2 == mp_add_~i~0 % 256); 1642#L84-1 assume !(3 == mp_add_~i~0 % 256); 1643#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1692#L87-1 [2021-08-31 01:54:09,781 INFO L793 eck$LassoCheckResult]: Loop: 1692#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1689#L91-1 assume !(1 == mp_add_~i~0 % 256); 1688#L92-1 assume !(2 == mp_add_~i~0 % 256); 1686#L93-1 assume !(3 == mp_add_~i~0 % 256); 1682#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1633#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1634#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1665#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1660#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1661#L87-1 assume !(0 == mp_add_~i~0 % 256); 1691#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 1722#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 1721#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 1720#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1621#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1610#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1611#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1717#L76-2 assume !(1 == mp_add_~i~0 % 256); 1701#L77-1 assume !(2 == mp_add_~i~0 % 256); 1700#L78-1 assume !(3 == mp_add_~i~0 % 256); 1699#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1694#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1692#L87-1 [2021-08-31 01:54:09,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 1 times [2021-08-31 01:54:09,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:09,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893479900] [2021-08-31 01:54:09,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:09,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:09,797 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:09,817 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:09,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:09,818 INFO L82 PathProgramCache]: Analyzing trace with hash 857385497, now seen corresponding path program 1 times [2021-08-31 01:54:09,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:09,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975433728] [2021-08-31 01:54:09,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:09,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-31 01:54:09,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:09,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975433728] [2021-08-31 01:54:09,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975433728] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:09,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:09,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 01:54:09,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474168386] [2021-08-31 01:54:09,833 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:09,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:09,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 01:54:09,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 01:54:09,834 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. cyclomatic complexity: 77 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:09,938 INFO L93 Difference]: Finished difference Result 194 states and 283 transitions. [2021-08-31 01:54:09,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 01:54:09,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 283 transitions. [2021-08-31 01:54:09,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 158 [2021-08-31 01:54:09,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 283 transitions. [2021-08-31 01:54:09,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2021-08-31 01:54:09,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2021-08-31 01:54:09,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 283 transitions. [2021-08-31 01:54:09,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:09,942 INFO L681 BuchiCegarLoop]: Abstraction has 194 states and 283 transitions. [2021-08-31 01:54:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 283 transitions. [2021-08-31 01:54:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2021-08-31 01:54:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 191 states have (on average 1.4659685863874345) internal successors, (280), 190 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 280 transitions. [2021-08-31 01:54:09,946 INFO L704 BuchiCegarLoop]: Abstraction has 191 states and 280 transitions. [2021-08-31 01:54:09,946 INFO L587 BuchiCegarLoop]: Abstraction has 191 states and 280 transitions. [2021-08-31 01:54:09,946 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 01:54:09,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 280 transitions. [2021-08-31 01:54:09,947 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 155 [2021-08-31 01:54:09,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:09,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:09,949 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:09,949 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:09,949 INFO L791 eck$LassoCheckResult]: Stem: 1946#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 1935#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1925#L51 assume !(0 == mp_add_~a3~0 % 256); 1926#L51-1 mp_add_~nb~0 := 4; 1927#L61 assume !(0 == mp_add_~b3~0 % 256); 1928#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1942#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2010#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2009#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2008#L76-2 assume !(1 == mp_add_~i~0 % 256); 2006#L77-1 assume !(2 == mp_add_~i~0 % 256); 2004#L78-1 assume !(3 == mp_add_~i~0 % 256); 2002#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 1996#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 1999#L82-2 assume !(1 == mp_add_~i~0 % 256); 1997#L83-1 assume !(2 == mp_add_~i~0 % 256); 1993#L84-1 assume !(3 == mp_add_~i~0 % 256); 1994#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2052#L87-1 [2021-08-31 01:54:09,949 INFO L793 eck$LassoCheckResult]: Loop: 2052#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2050#L91-1 assume !(1 == mp_add_~i~0 % 256); 2049#L92-1 assume !(2 == mp_add_~i~0 % 256); 2048#L93-1 assume !(3 == mp_add_~i~0 % 256); 2047#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1975#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1976#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 2024#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2019#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1938#L87-1 assume !(0 == mp_add_~i~0 % 256); 1931#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 1932#L92-1 assume !(2 == mp_add_~i~0 % 256); 1934#L93-1 assume !(3 == mp_add_~i~0 % 256); 1943#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2071#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2068#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2069#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2072#L76-2 assume !(1 == mp_add_~i~0 % 256); 2070#L77-1 assume !(2 == mp_add_~i~0 % 256); 2064#L78-1 assume !(3 == mp_add_~i~0 % 256); 2057#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2054#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2052#L87-1 [2021-08-31 01:54:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:09,950 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 2 times [2021-08-31 01:54:09,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:09,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747882760] [2021-08-31 01:54:09,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:09,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:09,964 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:09,982 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:09,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:09,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1165423065, now seen corresponding path program 1 times [2021-08-31 01:54:09,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:09,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074370104] [2021-08-31 01:54:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:09,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:10,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:10,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074370104] [2021-08-31 01:54:10,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074370104] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:10,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:10,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 01:54:10,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793789312] [2021-08-31 01:54:10,046 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:10,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:10,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 01:54:10,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-31 01:54:10,048 INFO L87 Difference]: Start difference. First operand 191 states and 280 transitions. cyclomatic complexity: 91 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:10,274 INFO L93 Difference]: Finished difference Result 367 states and 532 transitions. [2021-08-31 01:54:10,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 01:54:10,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 367 states and 532 transitions. [2021-08-31 01:54:10,277 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 311 [2021-08-31 01:54:10,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 367 states to 367 states and 532 transitions. [2021-08-31 01:54:10,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2021-08-31 01:54:10,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2021-08-31 01:54:10,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 367 states and 532 transitions. [2021-08-31 01:54:10,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:10,280 INFO L681 BuchiCegarLoop]: Abstraction has 367 states and 532 transitions. [2021-08-31 01:54:10,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states and 532 transitions. [2021-08-31 01:54:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 288. [2021-08-31 01:54:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 288 states have (on average 1.4548611111111112) internal successors, (419), 287 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 419 transitions. [2021-08-31 01:54:10,301 INFO L704 BuchiCegarLoop]: Abstraction has 288 states and 419 transitions. [2021-08-31 01:54:10,301 INFO L587 BuchiCegarLoop]: Abstraction has 288 states and 419 transitions. [2021-08-31 01:54:10,301 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 01:54:10,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 419 transitions. [2021-08-31 01:54:10,303 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 249 [2021-08-31 01:54:10,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:10,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:10,304 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:10,304 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:10,304 INFO L791 eck$LassoCheckResult]: Stem: 2517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 2504#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 2494#L51 assume !(0 == mp_add_~a3~0 % 256); 2495#L51-1 mp_add_~nb~0 := 4; 2496#L61 assume !(0 == mp_add_~b3~0 % 256); 2497#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2513#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2587#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2586#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2585#L76-2 assume !(1 == mp_add_~i~0 % 256); 2583#L77-1 assume !(2 == mp_add_~i~0 % 256); 2581#L78-1 assume !(3 == mp_add_~i~0 % 256); 2579#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 2573#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 2576#L82-2 assume !(1 == mp_add_~i~0 % 256); 2574#L83-1 assume !(2 == mp_add_~i~0 % 256); 2570#L84-1 assume !(3 == mp_add_~i~0 % 256); 2571#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2601#L87-1 [2021-08-31 01:54:10,304 INFO L793 eck$LassoCheckResult]: Loop: 2601#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2602#L91-1 assume !(1 == mp_add_~i~0 % 256); 2597#L92-1 assume !(2 == mp_add_~i~0 % 256); 2598#L93-1 assume !(3 == mp_add_~i~0 % 256); 2593#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2594#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2607#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 2608#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2531#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2723#L87-1 assume !(0 == mp_add_~i~0 % 256); 2722#L91-1 assume !(1 == mp_add_~i~0 % 256); 2502#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 2503#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 2515#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2546#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2547#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2604#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2605#L76-2 assume !(1 == mp_add_~i~0 % 256); 2655#L77-1 assume !(2 == mp_add_~i~0 % 256); 2649#L78-1 assume !(3 == mp_add_~i~0 % 256); 2650#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2617#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2601#L87-1 [2021-08-31 01:54:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:10,305 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 3 times [2021-08-31 01:54:10,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:10,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6367228] [2021-08-31 01:54:10,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:10,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:10,321 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:10,338 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:10,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:10,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1115550935, now seen corresponding path program 1 times [2021-08-31 01:54:10,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:10,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336650421] [2021-08-31 01:54:10,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:10,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-31 01:54:10,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:10,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336650421] [2021-08-31 01:54:10,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336650421] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:10,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:10,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 01:54:10,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592662682] [2021-08-31 01:54:10,355 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:10,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:10,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 01:54:10,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 01:54:10,356 INFO L87 Difference]: Start difference. First operand 288 states and 419 transitions. cyclomatic complexity: 134 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:10,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:10,444 INFO L93 Difference]: Finished difference Result 340 states and 495 transitions. [2021-08-31 01:54:10,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 01:54:10,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 340 states and 495 transitions. [2021-08-31 01:54:10,448 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 301 [2021-08-31 01:54:10,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 340 states to 340 states and 495 transitions. [2021-08-31 01:54:10,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 340 [2021-08-31 01:54:10,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 340 [2021-08-31 01:54:10,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 340 states and 495 transitions. [2021-08-31 01:54:10,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:10,451 INFO L681 BuchiCegarLoop]: Abstraction has 340 states and 495 transitions. [2021-08-31 01:54:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states and 495 transitions. [2021-08-31 01:54:10,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 334. [2021-08-31 01:54:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 334 states have (on average 1.464071856287425) internal successors, (489), 333 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 489 transitions. [2021-08-31 01:54:10,457 INFO L704 BuchiCegarLoop]: Abstraction has 334 states and 489 transitions. [2021-08-31 01:54:10,458 INFO L587 BuchiCegarLoop]: Abstraction has 334 states and 489 transitions. [2021-08-31 01:54:10,458 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 01:54:10,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 334 states and 489 transitions. [2021-08-31 01:54:10,459 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 295 [2021-08-31 01:54:10,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:10,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:10,460 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:10,460 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:10,461 INFO L791 eck$LassoCheckResult]: Stem: 3150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 3139#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 3131#L51 assume !(0 == mp_add_~a3~0 % 256); 3132#L51-1 mp_add_~nb~0 := 4; 3133#L61 assume !(0 == mp_add_~b3~0 % 256); 3134#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3145#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3219#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3218#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3217#L76-2 assume !(1 == mp_add_~i~0 % 256); 3215#L77-1 assume !(2 == mp_add_~i~0 % 256); 3213#L78-1 assume !(3 == mp_add_~i~0 % 256); 3211#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 3205#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 3208#L82-2 assume !(1 == mp_add_~i~0 % 256); 3206#L83-1 assume !(2 == mp_add_~i~0 % 256); 3202#L84-1 assume !(3 == mp_add_~i~0 % 256); 3203#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3236#L87-1 [2021-08-31 01:54:10,461 INFO L793 eck$LassoCheckResult]: Loop: 3236#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3237#L91-1 assume !(1 == mp_add_~i~0 % 256); 3228#L92-1 assume !(2 == mp_add_~i~0 % 256); 3229#L93-1 assume !(3 == mp_add_~i~0 % 256); 3224#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3225#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3260#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 3256#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3257#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3329#L87-1 assume !(0 == mp_add_~i~0 % 256); 3289#L91-1 assume !(1 == mp_add_~i~0 % 256); 3288#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 3146#L93-1 assume !(3 == mp_add_~i~0 % 256); 3147#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3191#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3283#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3284#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3319#L76-2 assume !(1 == mp_add_~i~0 % 256); 3448#L77-1 assume !(2 == mp_add_~i~0 % 256); 3447#L78-1 assume !(3 == mp_add_~i~0 % 256); 3446#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3442#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3236#L87-1 [2021-08-31 01:54:10,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:10,461 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 4 times [2021-08-31 01:54:10,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:10,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649906835] [2021-08-31 01:54:10,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:10,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:10,490 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:10,522 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:10,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:10,523 INFO L82 PathProgramCache]: Analyzing trace with hash 722523925, now seen corresponding path program 1 times [2021-08-31 01:54:10,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:10,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625798734] [2021-08-31 01:54:10,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:10,523 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:10,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:10,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625798734] [2021-08-31 01:54:10,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625798734] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:54:10,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517128983] [2021-08-31 01:54:10,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:10,638 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:54:10,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:54:10,645 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:54:10,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-31 01:54:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:10,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-31 01:54:10,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:54:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:10,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:54:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:11,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517128983] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:54:11,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:54:11,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2021-08-31 01:54:11,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796001785] [2021-08-31 01:54:11,059 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:11,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:11,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-31 01:54:11,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-31 01:54:11,060 INFO L87 Difference]: Start difference. First operand 334 states and 489 transitions. cyclomatic complexity: 158 Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:11,414 INFO L93 Difference]: Finished difference Result 498 states and 675 transitions. [2021-08-31 01:54:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-31 01:54:11,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 675 transitions. [2021-08-31 01:54:11,418 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 435 [2021-08-31 01:54:11,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 498 states and 675 transitions. [2021-08-31 01:54:11,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 498 [2021-08-31 01:54:11,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2021-08-31 01:54:11,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 498 states and 675 transitions. [2021-08-31 01:54:11,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:11,422 INFO L681 BuchiCegarLoop]: Abstraction has 498 states and 675 transitions. [2021-08-31 01:54:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states and 675 transitions. [2021-08-31 01:54:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 449. [2021-08-31 01:54:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 449 states have (on average 1.378619153674833) internal successors, (619), 448 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 619 transitions. [2021-08-31 01:54:11,431 INFO L704 BuchiCegarLoop]: Abstraction has 449 states and 619 transitions. [2021-08-31 01:54:11,431 INFO L587 BuchiCegarLoop]: Abstraction has 449 states and 619 transitions. [2021-08-31 01:54:11,432 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-31 01:54:11,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 449 states and 619 transitions. [2021-08-31 01:54:11,434 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 392 [2021-08-31 01:54:11,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:11,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:11,436 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:11,436 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:11,437 INFO L791 eck$LassoCheckResult]: Stem: 4125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 4110#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 4103#L51 assume !(0 == mp_add_~a3~0 % 256); 4104#L51-1 mp_add_~nb~0 := 4; 4105#L61 assume !(0 == mp_add_~b3~0 % 256); 4106#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4111#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4112#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4275#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4274#L76-2 assume !(1 == mp_add_~i~0 % 256); 4273#L77-1 assume !(2 == mp_add_~i~0 % 256); 4271#L78-1 assume !(3 == mp_add_~i~0 % 256); 4269#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4263#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4266#L82-2 assume !(1 == mp_add_~i~0 % 256); 4264#L83-1 assume !(2 == mp_add_~i~0 % 256); 4260#L84-1 assume !(3 == mp_add_~i~0 % 256); 4261#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4277#L87-1 [2021-08-31 01:54:11,439 INFO L793 eck$LassoCheckResult]: Loop: 4277#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4276#L91-1 assume !(1 == mp_add_~i~0 % 256); 4259#L92-1 assume !(2 == mp_add_~i~0 % 256); 4258#L93-1 assume !(3 == mp_add_~i~0 % 256); 4243#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4242#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4239#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4237#L76 assume !(0 == mp_add_~i~0 % 256); 4235#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 4233#L77-1 assume !(2 == mp_add_~i~0 % 256); 4230#L78-1 assume !(3 == mp_add_~i~0 % 256); 4226#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4222#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4223#L87-1 assume !(0 == mp_add_~i~0 % 256); 4218#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 4219#L92-1 assume !(2 == mp_add_~i~0 % 256); 4214#L93-1 assume !(3 == mp_add_~i~0 % 256); 4215#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4194#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4195#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4443#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4126#L76-2 assume !(1 == mp_add_~i~0 % 256); 4127#L77-1 assume !(2 == mp_add_~i~0 % 256); 4536#L78-1 assume !(3 == mp_add_~i~0 % 256); 4533#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4531#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4277#L87-1 [2021-08-31 01:54:11,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:11,439 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 5 times [2021-08-31 01:54:11,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:11,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023952546] [2021-08-31 01:54:11,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:11,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:11,459 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:11,480 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:11,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1570645289, now seen corresponding path program 1 times [2021-08-31 01:54:11,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:11,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890863256] [2021-08-31 01:54:11,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:11,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:11,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:11,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890863256] [2021-08-31 01:54:11,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890863256] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:11,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:11,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 01:54:11,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533332322] [2021-08-31 01:54:11,544 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:11,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:11,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 01:54:11,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 01:54:11,545 INFO L87 Difference]: Start difference. First operand 449 states and 619 transitions. cyclomatic complexity: 173 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:11,697 INFO L93 Difference]: Finished difference Result 580 states and 763 transitions. [2021-08-31 01:54:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 01:54:11,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 580 states and 763 transitions. [2021-08-31 01:54:11,701 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 516 [2021-08-31 01:54:11,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 580 states to 580 states and 763 transitions. [2021-08-31 01:54:11,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 580 [2021-08-31 01:54:11,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 580 [2021-08-31 01:54:11,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 580 states and 763 transitions. [2021-08-31 01:54:11,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:11,705 INFO L681 BuchiCegarLoop]: Abstraction has 580 states and 763 transitions. [2021-08-31 01:54:11,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states and 763 transitions. [2021-08-31 01:54:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 444. [2021-08-31 01:54:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 444 states have (on average 1.3355855855855856) internal successors, (593), 443 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:11,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 593 transitions. [2021-08-31 01:54:11,715 INFO L704 BuchiCegarLoop]: Abstraction has 444 states and 593 transitions. [2021-08-31 01:54:11,715 INFO L587 BuchiCegarLoop]: Abstraction has 444 states and 593 transitions. [2021-08-31 01:54:11,715 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-31 01:54:11,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 444 states and 593 transitions. [2021-08-31 01:54:11,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 406 [2021-08-31 01:54:11,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:11,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:11,719 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:11,719 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:11,719 INFO L791 eck$LassoCheckResult]: Stem: 5163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 5150#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 5144#L51 assume !(0 == mp_add_~a3~0 % 256); 5145#L51-1 mp_add_~nb~0 := 4; 5146#L61 assume !(0 == mp_add_~b3~0 % 256); 5147#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5160#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5417#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5416#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5415#L76-2 assume !(1 == mp_add_~i~0 % 256); 5414#L77-1 assume !(2 == mp_add_~i~0 % 256); 5412#L78-1 assume !(3 == mp_add_~i~0 % 256); 5410#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5402#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 5407#L82-2 assume !(1 == mp_add_~i~0 % 256); 5405#L83-1 assume !(2 == mp_add_~i~0 % 256); 5403#L84-1 assume !(3 == mp_add_~i~0 % 256); 5400#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5322#L87-1 [2021-08-31 01:54:11,720 INFO L793 eck$LassoCheckResult]: Loop: 5322#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5321#L91-1 assume !(1 == mp_add_~i~0 % 256); 5320#L92-1 assume !(2 == mp_add_~i~0 % 256); 5318#L93-1 assume !(3 == mp_add_~i~0 % 256); 5316#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5313#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5310#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 5311#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5536#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5535#L87-1 assume !(0 == mp_add_~i~0 % 256); 5534#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 5533#L92-1 assume !(2 == mp_add_~i~0 % 256); 5532#L93-1 assume !(3 == mp_add_~i~0 % 256); 5158#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5159#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5517#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 5251#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5512#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5513#L87-1 assume !(0 == mp_add_~i~0 % 256); 5219#L91-1 assume !(1 == mp_add_~i~0 % 256); 5220#L92-1 assume !(2 == mp_add_~i~0 % 256); 5346#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 5344#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5341#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5338#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5336#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5337#L76-2 assume !(1 == mp_add_~i~0 % 256); 5447#L77-1 assume !(2 == mp_add_~i~0 % 256); 5440#L78-1 assume !(3 == mp_add_~i~0 % 256); 5423#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5421#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5322#L87-1 [2021-08-31 01:54:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:11,720 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 6 times [2021-08-31 01:54:11,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:11,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514662859] [2021-08-31 01:54:11,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:11,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:11,741 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:11,771 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:11,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:11,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1950939250, now seen corresponding path program 1 times [2021-08-31 01:54:11,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:11,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321618263] [2021-08-31 01:54:11,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:11,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:11,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:11,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321618263] [2021-08-31 01:54:11,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321618263] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:11,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:11,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 01:54:11,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073777630] [2021-08-31 01:54:11,816 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:11,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:11,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 01:54:11,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 01:54:11,816 INFO L87 Difference]: Start difference. First operand 444 states and 593 transitions. cyclomatic complexity: 151 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:11,968 INFO L93 Difference]: Finished difference Result 514 states and 668 transitions. [2021-08-31 01:54:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 01:54:11,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 668 transitions. [2021-08-31 01:54:11,971 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 476 [2021-08-31 01:54:11,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 514 states and 668 transitions. [2021-08-31 01:54:11,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 514 [2021-08-31 01:54:11,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 514 [2021-08-31 01:54:11,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 514 states and 668 transitions. [2021-08-31 01:54:11,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:11,975 INFO L681 BuchiCegarLoop]: Abstraction has 514 states and 668 transitions. [2021-08-31 01:54:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states and 668 transitions. [2021-08-31 01:54:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 432. [2021-08-31 01:54:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 432 states have (on average 1.3055555555555556) internal successors, (564), 431 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 564 transitions. [2021-08-31 01:54:11,981 INFO L704 BuchiCegarLoop]: Abstraction has 432 states and 564 transitions. [2021-08-31 01:54:11,981 INFO L587 BuchiCegarLoop]: Abstraction has 432 states and 564 transitions. [2021-08-31 01:54:11,982 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-31 01:54:11,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 432 states and 564 transitions. [2021-08-31 01:54:11,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 394 [2021-08-31 01:54:11,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:11,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:11,984 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:11,984 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:11,985 INFO L791 eck$LassoCheckResult]: Stem: 6125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 6114#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 6105#L51 assume !(0 == mp_add_~a3~0 % 256); 6106#L51-1 mp_add_~nb~0 := 4; 6107#L61 assume !(0 == mp_add_~b3~0 % 256); 6108#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6122#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6476#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6475#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6474#L76-2 assume !(1 == mp_add_~i~0 % 256); 6473#L77-1 assume !(2 == mp_add_~i~0 % 256); 6468#L78-1 assume !(3 == mp_add_~i~0 % 256); 6466#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6453#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6460#L82-2 assume !(1 == mp_add_~i~0 % 256); 6456#L83-1 assume !(2 == mp_add_~i~0 % 256); 6443#L84-1 assume !(3 == mp_add_~i~0 % 256); 6434#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 6371#L87-1 [2021-08-31 01:54:11,985 INFO L793 eck$LassoCheckResult]: Loop: 6371#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6367#L91-1 assume !(1 == mp_add_~i~0 % 256); 6363#L92-1 assume !(2 == mp_add_~i~0 % 256); 6360#L93-1 assume !(3 == mp_add_~i~0 % 256); 6357#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6354#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6351#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6340#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6173#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6172#L87-1 assume !(0 == mp_add_~i~0 % 256); 6171#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 6170#L92-1 assume !(2 == mp_add_~i~0 % 256); 6169#L93-1 assume !(3 == mp_add_~i~0 % 256); 6168#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6165#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6166#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6249#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6245#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6239#L87-1 assume !(0 == mp_add_~i~0 % 256); 6223#L91-1 assume !(1 == mp_add_~i~0 % 256); 6196#L92-1 assume !(2 == mp_add_~i~0 % 256); 6194#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 6192#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6189#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6190#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6278#L76 assume !(0 == mp_add_~i~0 % 256); 6270#L76-2 assume !(1 == mp_add_~i~0 % 256); 6272#L77-1 assume !(2 == mp_add_~i~0 % 256); 6516#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 6387#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6515#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6256#L82-2 assume !(1 == mp_add_~i~0 % 256); 6451#L83-1 assume !(2 == mp_add_~i~0 % 256); 6444#L84-1 assume !(3 == mp_add_~i~0 % 256); 6435#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 6371#L87-1 [2021-08-31 01:54:11,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:11,985 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 7 times [2021-08-31 01:54:11,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:11,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822254375] [2021-08-31 01:54:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:11,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:11,996 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:12,008 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:12,009 INFO L82 PathProgramCache]: Analyzing trace with hash 170986874, now seen corresponding path program 1 times [2021-08-31 01:54:12,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:12,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954484060] [2021-08-31 01:54:12,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:12,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-08-31 01:54:12,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:12,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954484060] [2021-08-31 01:54:12,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954484060] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:12,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:12,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 01:54:12,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658674235] [2021-08-31 01:54:12,032 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:12,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:12,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 01:54:12,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 01:54:12,033 INFO L87 Difference]: Start difference. First operand 432 states and 564 transitions. cyclomatic complexity: 134 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:12,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:12,138 INFO L93 Difference]: Finished difference Result 431 states and 548 transitions. [2021-08-31 01:54:12,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 01:54:12,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 548 transitions. [2021-08-31 01:54:12,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 393 [2021-08-31 01:54:12,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 431 states and 548 transitions. [2021-08-31 01:54:12,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 431 [2021-08-31 01:54:12,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 431 [2021-08-31 01:54:12,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 431 states and 548 transitions. [2021-08-31 01:54:12,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:12,145 INFO L681 BuchiCegarLoop]: Abstraction has 431 states and 548 transitions. [2021-08-31 01:54:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states and 548 transitions. [2021-08-31 01:54:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 398. [2021-08-31 01:54:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 398 states have (on average 1.263819095477387) internal successors, (503), 397 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 503 transitions. [2021-08-31 01:54:12,152 INFO L704 BuchiCegarLoop]: Abstraction has 398 states and 503 transitions. [2021-08-31 01:54:12,152 INFO L587 BuchiCegarLoop]: Abstraction has 398 states and 503 transitions. [2021-08-31 01:54:12,152 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-31 01:54:12,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 398 states and 503 transitions. [2021-08-31 01:54:12,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 360 [2021-08-31 01:54:12,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:12,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:12,155 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:12,155 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:12,155 INFO L791 eck$LassoCheckResult]: Stem: 6994#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 6983#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 6974#L51 assume !(0 == mp_add_~a3~0 % 256); 6975#L51-1 mp_add_~nb~0 := 4; 6976#L61 assume !(0 == mp_add_~b3~0 % 256); 6977#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6984#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6985#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7014#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6995#L76-2 assume !(1 == mp_add_~i~0 % 256); 6996#L77-1 assume !(2 == mp_add_~i~0 % 256); 7352#L78-1 assume !(3 == mp_add_~i~0 % 256); 7351#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7316#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7331#L82-2 assume !(1 == mp_add_~i~0 % 256); 7330#L83-1 assume !(2 == mp_add_~i~0 % 256); 7258#L84-1 assume !(3 == mp_add_~i~0 % 256); 7259#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7237#L87-1 [2021-08-31 01:54:12,155 INFO L793 eck$LassoCheckResult]: Loop: 7237#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7235#L91-1 assume !(1 == mp_add_~i~0 % 256); 7233#L92-1 assume !(2 == mp_add_~i~0 % 256); 7230#L93-1 assume !(3 == mp_add_~i~0 % 256); 7227#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7224#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7219#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 7212#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 7213#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6986#L87-1 assume !(0 == mp_add_~i~0 % 256); 6987#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 7084#L92-1 assume !(2 == mp_add_~i~0 % 256); 7080#L93-1 assume !(3 == mp_add_~i~0 % 256); 7077#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7071#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7072#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 7119#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 7115#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7114#L87-1 assume !(0 == mp_add_~i~0 % 256); 7048#L91-1 assume !(1 == mp_add_~i~0 % 256); 7039#L92-1 assume !(2 == mp_add_~i~0 % 256); 7036#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 7034#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7029#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7030#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7246#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7287#L76-2 assume !(1 == mp_add_~i~0 % 256); 7329#L77-1 assume !(2 == mp_add_~i~0 % 256); 7328#L78-1 assume !(3 == mp_add_~i~0 % 256); 7325#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7261#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7322#L82-2 assume !(1 == mp_add_~i~0 % 256); 7320#L83-1 assume !(2 == mp_add_~i~0 % 256); 7318#L84-1 assume !(3 == mp_add_~i~0 % 256); 7239#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7237#L87-1 [2021-08-31 01:54:12,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:12,156 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 8 times [2021-08-31 01:54:12,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:12,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105188685] [2021-08-31 01:54:12,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:12,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:12,166 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:12,178 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:12,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:12,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1955946050, now seen corresponding path program 1 times [2021-08-31 01:54:12,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:12,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235667943] [2021-08-31 01:54:12,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:12,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 01:54:12,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:12,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235667943] [2021-08-31 01:54:12,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235667943] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:54:12,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332528999] [2021-08-31 01:54:12,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:12,226 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:54:12,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:54:12,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:54:12,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-31 01:54:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:12,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 01:54:12,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:54:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-31 01:54:12,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:54:12,490 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-31 01:54:12,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332528999] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:54:12,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:54:12,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-08-31 01:54:12,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353215953] [2021-08-31 01:54:12,491 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:12,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-31 01:54:12,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-31 01:54:12,492 INFO L87 Difference]: Start difference. First operand 398 states and 503 transitions. cyclomatic complexity: 107 Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:13,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:13,442 INFO L93 Difference]: Finished difference Result 459 states and 548 transitions. [2021-08-31 01:54:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-31 01:54:13,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 459 states and 548 transitions. [2021-08-31 01:54:13,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 418 [2021-08-31 01:54:13,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 459 states to 459 states and 548 transitions. [2021-08-31 01:54:13,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 459 [2021-08-31 01:54:13,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 459 [2021-08-31 01:54:13,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 548 transitions. [2021-08-31 01:54:13,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:13,449 INFO L681 BuchiCegarLoop]: Abstraction has 459 states and 548 transitions. [2021-08-31 01:54:13,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 548 transitions. [2021-08-31 01:54:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 279. [2021-08-31 01:54:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 279 states have (on average 1.2508960573476702) internal successors, (349), 278 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 349 transitions. [2021-08-31 01:54:13,455 INFO L704 BuchiCegarLoop]: Abstraction has 279 states and 349 transitions. [2021-08-31 01:54:13,455 INFO L587 BuchiCegarLoop]: Abstraction has 279 states and 349 transitions. [2021-08-31 01:54:13,455 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-31 01:54:13,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 349 transitions. [2021-08-31 01:54:13,456 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 243 [2021-08-31 01:54:13,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:13,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:13,457 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:13,457 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:13,457 INFO L791 eck$LassoCheckResult]: Stem: 8138#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 8125#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 8116#L51 assume !(0 == mp_add_~a3~0 % 256); 8117#L51-1 mp_add_~nb~0 := 4; 8118#L61 assume !(0 == mp_add_~b3~0 % 256); 8119#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 8313#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8312#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8311#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8310#L76-2 assume !(1 == mp_add_~i~0 % 256); 8297#L77-1 assume !(2 == mp_add_~i~0 % 256); 8298#L78-1 assume !(3 == mp_add_~i~0 % 256); 8278#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8277#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8276#L82-2 assume !(1 == mp_add_~i~0 % 256); 8275#L83-1 assume !(2 == mp_add_~i~0 % 256); 8274#L84-1 assume !(3 == mp_add_~i~0 % 256); 8272#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 8270#L87-1 [2021-08-31 01:54:13,457 INFO L793 eck$LassoCheckResult]: Loop: 8270#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8269#L91-1 assume !(1 == mp_add_~i~0 % 256); 8268#L92-1 assume !(2 == mp_add_~i~0 % 256); 8267#L93-1 assume !(3 == mp_add_~i~0 % 256); 8266#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8265#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8248#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8242#L76 assume !(0 == mp_add_~i~0 % 256); 8241#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 8240#L77-1 assume !(2 == mp_add_~i~0 % 256); 8238#L78-1 assume !(3 == mp_add_~i~0 % 256); 8235#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8232#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 8231#L87-1 assume !(0 == mp_add_~i~0 % 256); 8229#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 8227#L92-1 assume !(2 == mp_add_~i~0 % 256); 8225#L93-1 assume !(3 == mp_add_~i~0 % 256); 8223#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8215#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8216#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8217#L76 assume !(0 == mp_add_~i~0 % 256); 8218#L76-2 assume !(1 == mp_add_~i~0 % 256); 8211#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 8212#L78-1 assume !(3 == mp_add_~i~0 % 256); 8364#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8363#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 8362#L87-1 assume !(0 == mp_add_~i~0 % 256); 8361#L91-1 assume !(1 == mp_add_~i~0 % 256); 8360#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 8359#L93-1 assume !(3 == mp_add_~i~0 % 256); 8358#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8357#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8355#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8288#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8286#L76-2 assume !(1 == mp_add_~i~0 % 256); 8285#L77-1 assume !(2 == mp_add_~i~0 % 256); 8283#L78-1 assume !(3 == mp_add_~i~0 % 256); 8280#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8271#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 8270#L87-1 [2021-08-31 01:54:13,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:13,458 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 9 times [2021-08-31 01:54:13,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:13,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143994943] [2021-08-31 01:54:13,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:13,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:13,474 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:13,489 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:13,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1646111466, now seen corresponding path program 1 times [2021-08-31 01:54:13,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:13,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088292524] [2021-08-31 01:54:13,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:13,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-31 01:54:13,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:13,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088292524] [2021-08-31 01:54:13,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088292524] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:13,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:13,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 01:54:13,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884850259] [2021-08-31 01:54:13,551 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:13,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:13,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 01:54:13,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 01:54:13,552 INFO L87 Difference]: Start difference. First operand 279 states and 349 transitions. cyclomatic complexity: 72 Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:13,710 INFO L93 Difference]: Finished difference Result 343 states and 413 transitions. [2021-08-31 01:54:13,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 01:54:13,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 343 states and 413 transitions. [2021-08-31 01:54:13,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 307 [2021-08-31 01:54:13,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 343 states to 343 states and 413 transitions. [2021-08-31 01:54:13,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 343 [2021-08-31 01:54:13,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 343 [2021-08-31 01:54:13,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 343 states and 413 transitions. [2021-08-31 01:54:13,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:13,715 INFO L681 BuchiCegarLoop]: Abstraction has 343 states and 413 transitions. [2021-08-31 01:54:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states and 413 transitions. [2021-08-31 01:54:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 279. [2021-08-31 01:54:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 279 states have (on average 1.2293906810035842) internal successors, (343), 278 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 343 transitions. [2021-08-31 01:54:13,722 INFO L704 BuchiCegarLoop]: Abstraction has 279 states and 343 transitions. [2021-08-31 01:54:13,722 INFO L587 BuchiCegarLoop]: Abstraction has 279 states and 343 transitions. [2021-08-31 01:54:13,722 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-31 01:54:13,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 343 transitions. [2021-08-31 01:54:13,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 243 [2021-08-31 01:54:13,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:13,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:13,725 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:13,725 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:13,725 INFO L791 eck$LassoCheckResult]: Stem: 8768#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 8759#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 8751#L51 assume !(0 == mp_add_~a3~0 % 256); 8752#L51-1 mp_add_~nb~0 := 4; 8753#L61 assume !(0 == mp_add_~b3~0 % 256); 8754#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 9021#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9020#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9019#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 9018#L76-2 assume !(1 == mp_add_~i~0 % 256); 9017#L77-1 assume !(2 == mp_add_~i~0 % 256); 9016#L78-1 assume !(3 == mp_add_~i~0 % 256); 9003#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9000#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8999#L82-2 assume !(1 == mp_add_~i~0 % 256); 8998#L83-1 assume !(2 == mp_add_~i~0 % 256); 8997#L84-1 assume !(3 == mp_add_~i~0 % 256); 8972#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 8970#L87-1 [2021-08-31 01:54:13,725 INFO L793 eck$LassoCheckResult]: Loop: 8970#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8968#L91-1 assume !(1 == mp_add_~i~0 % 256); 8951#L92-1 assume !(2 == mp_add_~i~0 % 256); 8952#L93-1 assume !(3 == mp_add_~i~0 % 256); 8922#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8923#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8914#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8915#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8945#L82 assume !(0 == mp_add_~i~0 % 256); 8924#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 8921#L83-1 assume !(2 == mp_add_~i~0 % 256); 8917#L84-1 assume !(3 == mp_add_~i~0 % 256); 8912#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 8910#L87-1 assume !(0 == mp_add_~i~0 % 256); 8907#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 8903#L92-1 assume !(2 == mp_add_~i~0 % 256); 8898#L93-1 assume !(3 == mp_add_~i~0 % 256); 8891#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8889#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8887#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8845#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8825#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8815#L87-1 assume !(0 == mp_add_~i~0 % 256); 8813#L91-1 assume !(1 == mp_add_~i~0 % 256); 8811#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 8809#L93-1 assume !(3 == mp_add_~i~0 % 256); 8807#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8804#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8805#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8882#L76 assume !(0 == mp_add_~i~0 % 256); 8876#L76-2 assume !(1 == mp_add_~i~0 % 256); 8878#L77-1 assume !(2 == mp_add_~i~0 % 256); 8849#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 8842#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8837#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8835#L87-1 assume !(0 == mp_add_~i~0 % 256); 8831#L91-1 assume !(1 == mp_add_~i~0 % 256); 8830#L92-1 assume !(2 == mp_add_~i~0 % 256); 8828#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 8795#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8793#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8794#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8946#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 9006#L76-2 assume !(1 == mp_add_~i~0 % 256); 9005#L77-1 assume !(2 == mp_add_~i~0 % 256); 9004#L78-1 assume !(3 == mp_add_~i~0 % 256); 9001#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8979#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8991#L82-2 assume !(1 == mp_add_~i~0 % 256); 8989#L83-1 assume !(2 == mp_add_~i~0 % 256); 8976#L84-1 assume !(3 == mp_add_~i~0 % 256); 8977#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 8970#L87-1 [2021-08-31 01:54:13,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:13,726 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 10 times [2021-08-31 01:54:13,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:13,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795214609] [2021-08-31 01:54:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:13,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:13,737 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:13,751 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:13,752 INFO L82 PathProgramCache]: Analyzing trace with hash 302130057, now seen corresponding path program 1 times [2021-08-31 01:54:13,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:13,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70288910] [2021-08-31 01:54:13,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:13,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-31 01:54:13,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:13,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70288910] [2021-08-31 01:54:13,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70288910] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:54:13,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556091133] [2021-08-31 01:54:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:13,799 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:54:13,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:54:13,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:54:13,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-31 01:54:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:13,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 01:54:13,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:54:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 51 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-31 01:54:14,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:54:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-31 01:54:14,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556091133] provided 1 perfect and 1 imperfect interpolant sequences [2021-08-31 01:54:14,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-08-31 01:54:14,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2021-08-31 01:54:14,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928651272] [2021-08-31 01:54:14,202 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:14,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:14,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 01:54:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-31 01:54:14,203 INFO L87 Difference]: Start difference. First operand 279 states and 343 transitions. cyclomatic complexity: 66 Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:14,468 INFO L93 Difference]: Finished difference Result 521 states and 639 transitions. [2021-08-31 01:54:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 01:54:14,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 521 states and 639 transitions. [2021-08-31 01:54:14,471 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 464 [2021-08-31 01:54:14,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 521 states to 521 states and 639 transitions. [2021-08-31 01:54:14,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 521 [2021-08-31 01:54:14,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 521 [2021-08-31 01:54:14,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 521 states and 639 transitions. [2021-08-31 01:54:14,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:14,474 INFO L681 BuchiCegarLoop]: Abstraction has 521 states and 639 transitions. [2021-08-31 01:54:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states and 639 transitions. [2021-08-31 01:54:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 428. [2021-08-31 01:54:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 428 states have (on average 1.2476635514018692) internal successors, (534), 427 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 534 transitions. [2021-08-31 01:54:14,481 INFO L704 BuchiCegarLoop]: Abstraction has 428 states and 534 transitions. [2021-08-31 01:54:14,481 INFO L587 BuchiCegarLoop]: Abstraction has 428 states and 534 transitions. [2021-08-31 01:54:14,481 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-08-31 01:54:14,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 428 states and 534 transitions. [2021-08-31 01:54:14,483 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 392 [2021-08-31 01:54:14,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:14,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:14,484 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:14,484 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:14,484 INFO L791 eck$LassoCheckResult]: Stem: 9895#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 9882#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 9873#L51 assume !(0 == mp_add_~a3~0 % 256); 9874#L51-1 mp_add_~nb~0 := 4; 9875#L61 assume !(0 == mp_add_~b3~0 % 256); 9876#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 9891#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10260#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10259#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 10258#L76-2 assume !(1 == mp_add_~i~0 % 256); 10256#L77-1 assume !(2 == mp_add_~i~0 % 256); 10179#L78-1 assume !(3 == mp_add_~i~0 % 256); 10175#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 10174#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 10172#L82-2 assume !(1 == mp_add_~i~0 % 256); 10173#L83-1 assume !(2 == mp_add_~i~0 % 256); 10161#L84-1 assume !(3 == mp_add_~i~0 % 256); 10162#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 10154#L87-1 [2021-08-31 01:54:14,484 INFO L793 eck$LassoCheckResult]: Loop: 10154#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 10151#L91-1 assume !(1 == mp_add_~i~0 % 256); 10152#L92-1 assume !(2 == mp_add_~i~0 % 256); 10129#L93-1 assume !(3 == mp_add_~i~0 % 256); 10130#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10122#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10123#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10117#L76 assume !(0 == mp_add_~i~0 % 256); 10112#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 10039#L77-1 assume !(2 == mp_add_~i~0 % 256); 10040#L78-1 assume !(3 == mp_add_~i~0 % 256); 10031#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 10030#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 10024#L87-1 assume !(0 == mp_add_~i~0 % 256); 10025#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 10020#L92-1 assume !(2 == mp_add_~i~0 % 256); 10021#L93-1 assume !(3 == mp_add_~i~0 % 256); 10016#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10017#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10011#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10012#L76 assume !(0 == mp_add_~i~0 % 256); 10007#L76-2 assume !(1 == mp_add_~i~0 % 256); 10008#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 10003#L78-1 assume !(3 == mp_add_~i~0 % 256); 10004#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 9994#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 9995#L87-1 assume !(0 == mp_add_~i~0 % 256); 9990#L91-1 assume !(1 == mp_add_~i~0 % 256); 9991#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 9987#L93-1 assume !(3 == mp_add_~i~0 % 256); 9986#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9984#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9985#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10102#L76 assume !(0 == mp_add_~i~0 % 256); 10100#L76-2 assume !(1 == mp_add_~i~0 % 256); 10097#L77-1 assume !(2 == mp_add_~i~0 % 256); 10094#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 10095#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 10134#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 10133#L87-1 assume !(0 == mp_add_~i~0 % 256); 10132#L91-1 assume !(1 == mp_add_~i~0 % 256); 10131#L92-1 assume !(2 == mp_add_~i~0 % 256); 10128#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 10125#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10126#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10118#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10119#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 10167#L76-2 assume !(1 == mp_add_~i~0 % 256); 10166#L77-1 assume !(2 == mp_add_~i~0 % 256); 10165#L78-1 assume !(3 == mp_add_~i~0 % 256); 10163#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 10157#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 10154#L87-1 [2021-08-31 01:54:14,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:14,485 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 11 times [2021-08-31 01:54:14,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:14,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006389982] [2021-08-31 01:54:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:14,485 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:14,494 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:14,505 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:14,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:14,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2057713071, now seen corresponding path program 1 times [2021-08-31 01:54:14,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:14,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441425783] [2021-08-31 01:54:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:14,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-31 01:54:14,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:14,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441425783] [2021-08-31 01:54:14,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441425783] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:14,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:14,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 01:54:14,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465882843] [2021-08-31 01:54:14,547 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:14,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:14,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 01:54:14,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 01:54:14,548 INFO L87 Difference]: Start difference. First operand 428 states and 534 transitions. cyclomatic complexity: 109 Second operand has 4 states, 4 states have (on average 8.5) 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) [2021-08-31 01:54:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:14,686 INFO L93 Difference]: Finished difference Result 536 states and 653 transitions. [2021-08-31 01:54:14,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 01:54:14,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 536 states and 653 transitions. [2021-08-31 01:54:14,690 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 484 [2021-08-31 01:54:14,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 536 states to 536 states and 653 transitions. [2021-08-31 01:54:14,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 536 [2021-08-31 01:54:14,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 536 [2021-08-31 01:54:14,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 536 states and 653 transitions. [2021-08-31 01:54:14,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:14,693 INFO L681 BuchiCegarLoop]: Abstraction has 536 states and 653 transitions. [2021-08-31 01:54:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states and 653 transitions. [2021-08-31 01:54:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 432. [2021-08-31 01:54:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 432 states have (on average 1.2407407407407407) internal successors, (536), 431 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 536 transitions. [2021-08-31 01:54:14,699 INFO L704 BuchiCegarLoop]: Abstraction has 432 states and 536 transitions. [2021-08-31 01:54:14,699 INFO L587 BuchiCegarLoop]: Abstraction has 432 states and 536 transitions. [2021-08-31 01:54:14,699 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-08-31 01:54:14,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 432 states and 536 transitions. [2021-08-31 01:54:14,701 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 387 [2021-08-31 01:54:14,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:14,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:14,702 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:14,702 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:14,702 INFO L791 eck$LassoCheckResult]: Stem: 10869#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 10856#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 10847#L51 assume !(0 == mp_add_~a3~0 % 256); 10848#L51-1 mp_add_~nb~0 := 4; 10849#L61 assume !(0 == mp_add_~b3~0 % 256); 10850#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 11176#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11177#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11171#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 11172#L76-2 assume !(1 == mp_add_~i~0 % 256); 11160#L77-1 assume !(2 == mp_add_~i~0 % 256); 11161#L78-1 assume !(3 == mp_add_~i~0 % 256); 11147#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11145#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 11143#L82-2 assume !(1 == mp_add_~i~0 % 256); 11141#L83-1 assume !(2 == mp_add_~i~0 % 256); 11139#L84-1 assume !(3 == mp_add_~i~0 % 256); 11135#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 11132#L87-1 [2021-08-31 01:54:14,702 INFO L793 eck$LassoCheckResult]: Loop: 11132#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 11133#L91-1 assume !(1 == mp_add_~i~0 % 256); 11127#L92-1 assume !(2 == mp_add_~i~0 % 256); 11128#L93-1 assume !(3 == mp_add_~i~0 % 256); 11111#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11112#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11058#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11059#L76 assume !(0 == mp_add_~i~0 % 256); 11054#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 11053#L77-1 assume !(2 == mp_add_~i~0 % 256); 11052#L78-1 assume !(3 == mp_add_~i~0 % 256); 11050#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 11045#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 11043#L87-1 assume !(0 == mp_add_~i~0 % 256); 11041#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 11039#L92-1 assume !(2 == mp_add_~i~0 % 256); 11037#L93-1 assume !(3 == mp_add_~i~0 % 256); 11035#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11033#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11030#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11028#L76 assume !(0 == mp_add_~i~0 % 256); 11026#L76-2 assume !(1 == mp_add_~i~0 % 256); 11024#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 11020#L78-1 assume !(3 == mp_add_~i~0 % 256); 11019#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 11017#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 11011#L87-1 assume !(0 == mp_add_~i~0 % 256); 10998#L91-1 assume !(1 == mp_add_~i~0 % 256); 10995#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 10992#L93-1 assume !(3 == mp_add_~i~0 % 256); 10989#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10984#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10985#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 11002#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 11126#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 10964#L87-1 assume !(0 == mp_add_~i~0 % 256); 10965#L91-1 assume !(1 == mp_add_~i~0 % 256); 10948#L92-1 assume !(2 == mp_add_~i~0 % 256); 10949#L93-1 assume !(3 == mp_add_~i~0 % 256); 10896#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10897#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11155#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11153#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 11152#L76-2 assume !(1 == mp_add_~i~0 % 256); 11151#L77-1 assume !(2 == mp_add_~i~0 % 256); 11150#L78-1 assume !(3 == mp_add_~i~0 % 256); 11148#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11146#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 11144#L82-2 assume !(1 == mp_add_~i~0 % 256); 11142#L83-1 assume !(2 == mp_add_~i~0 % 256); 11140#L84-1 assume !(3 == mp_add_~i~0 % 256); 11137#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 11132#L87-1 [2021-08-31 01:54:14,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:14,703 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 12 times [2021-08-31 01:54:14,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:14,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436570718] [2021-08-31 01:54:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:14,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:14,712 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:14,722 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:14,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:14,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1141661193, now seen corresponding path program 1 times [2021-08-31 01:54:14,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:14,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252531061] [2021-08-31 01:54:14,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:14,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:14,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:14,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252531061] [2021-08-31 01:54:14,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252531061] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:54:14,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816750223] [2021-08-31 01:54:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:14,818 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:54:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:54:14,819 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:54:14,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-31 01:54:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:14,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-31 01:54:14,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:54:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-31 01:54:15,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:54:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-31 01:54:15,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816750223] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:54:15,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:54:15,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2021-08-31 01:54:15,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254203419] [2021-08-31 01:54:15,278 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:15,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:15,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-31 01:54:15,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-08-31 01:54:15,279 INFO L87 Difference]: Start difference. First operand 432 states and 536 transitions. cyclomatic complexity: 107 Second operand has 14 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:15,771 INFO L93 Difference]: Finished difference Result 595 states and 714 transitions. [2021-08-31 01:54:15,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-31 01:54:15,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 595 states and 714 transitions. [2021-08-31 01:54:15,775 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 530 [2021-08-31 01:54:15,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 595 states to 593 states and 712 transitions. [2021-08-31 01:54:15,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 593 [2021-08-31 01:54:15,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 593 [2021-08-31 01:54:15,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 593 states and 712 transitions. [2021-08-31 01:54:15,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:15,781 INFO L681 BuchiCegarLoop]: Abstraction has 593 states and 712 transitions. [2021-08-31 01:54:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states and 712 transitions. [2021-08-31 01:54:15,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 429. [2021-08-31 01:54:15,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 429 states have (on average 1.2261072261072261) internal successors, (526), 428 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) [2021-08-31 01:54:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 526 transitions. [2021-08-31 01:54:15,788 INFO L704 BuchiCegarLoop]: Abstraction has 429 states and 526 transitions. [2021-08-31 01:54:15,788 INFO L587 BuchiCegarLoop]: Abstraction has 429 states and 526 transitions. [2021-08-31 01:54:15,788 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-08-31 01:54:15,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 526 transitions. [2021-08-31 01:54:15,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 385 [2021-08-31 01:54:15,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:15,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:15,790 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:15,791 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:15,791 INFO L791 eck$LassoCheckResult]: Stem: 12223#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 12212#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 12203#L51 assume !(0 == mp_add_~a3~0 % 256); 12204#L51-1 mp_add_~nb~0 := 4; 12205#L61 assume !(0 == mp_add_~b3~0 % 256); 12206#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 12613#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12612#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12244#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12245#L76-2 assume !(1 == mp_add_~i~0 % 256); 12571#L77-1 assume !(2 == mp_add_~i~0 % 256); 12572#L78-1 assume !(3 == mp_add_~i~0 % 256); 12532#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12529#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 12530#L82-2 assume !(1 == mp_add_~i~0 % 256); 12521#L83-1 assume !(2 == mp_add_~i~0 % 256); 12522#L84-1 assume !(3 == mp_add_~i~0 % 256); 12514#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12513#L87-1 [2021-08-31 01:54:15,791 INFO L793 eck$LassoCheckResult]: Loop: 12513#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 12512#L91-1 assume !(1 == mp_add_~i~0 % 256); 12511#L92-1 assume !(2 == mp_add_~i~0 % 256); 12510#L93-1 assume !(3 == mp_add_~i~0 % 256); 12509#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12508#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12507#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12505#L76 assume !(0 == mp_add_~i~0 % 256); 12501#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 12498#L77-1 assume !(2 == mp_add_~i~0 % 256); 12495#L78-1 assume !(3 == mp_add_~i~0 % 256); 12392#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12388#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12386#L87-1 assume !(0 == mp_add_~i~0 % 256); 12383#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 12381#L92-1 assume !(2 == mp_add_~i~0 % 256); 12379#L93-1 assume !(3 == mp_add_~i~0 % 256); 12355#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12351#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12347#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12348#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12374#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12334#L87-1 assume !(0 == mp_add_~i~0 % 256); 12430#L91-1 assume !(1 == mp_add_~i~0 % 256); 12429#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 12275#L93-1 assume !(3 == mp_add_~i~0 % 256); 12276#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12268#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12269#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12427#L76 assume !(0 == mp_add_~i~0 % 256); 12426#L76-2 assume !(1 == mp_add_~i~0 % 256); 12306#L77-1 assume !(2 == mp_add_~i~0 % 256); 12307#L78-1 assume !(3 == mp_add_~i~0 % 256); 12320#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12315#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12630#L87-1 assume !(0 == mp_add_~i~0 % 256); 12485#L91-1 assume !(1 == mp_add_~i~0 % 256); 12484#L92-1 assume !(2 == mp_add_~i~0 % 256); 12483#L93-1 assume !(3 == mp_add_~i~0 % 256); 12482#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12265#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12266#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12591#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12590#L76-2 assume !(1 == mp_add_~i~0 % 256); 12589#L77-1 assume !(2 == mp_add_~i~0 % 256); 12588#L78-1 assume !(3 == mp_add_~i~0 % 256); 12586#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12587#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 12524#L82-2 assume !(1 == mp_add_~i~0 % 256); 12525#L83-1 assume !(2 == mp_add_~i~0 % 256); 12518#L84-1 assume !(3 == mp_add_~i~0 % 256); 12519#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12513#L87-1 [2021-08-31 01:54:15,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:15,791 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 13 times [2021-08-31 01:54:15,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:15,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561692171] [2021-08-31 01:54:15,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:15,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:15,802 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:15,815 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:15,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:15,815 INFO L82 PathProgramCache]: Analyzing trace with hash 703287461, now seen corresponding path program 1 times [2021-08-31 01:54:15,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:15,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090358111] [2021-08-31 01:54:15,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:15,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:15,885 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-31 01:54:15,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:15,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090358111] [2021-08-31 01:54:15,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090358111] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:15,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:15,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-31 01:54:15,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564438770] [2021-08-31 01:54:15,887 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:15,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:15,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 01:54:15,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-31 01:54:15,887 INFO L87 Difference]: Start difference. First operand 429 states and 526 transitions. cyclomatic complexity: 100 Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:16,246 INFO L93 Difference]: Finished difference Result 824 states and 991 transitions. [2021-08-31 01:54:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-31 01:54:16,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 824 states and 991 transitions. [2021-08-31 01:54:16,251 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 719 [2021-08-31 01:54:16,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 824 states to 824 states and 991 transitions. [2021-08-31 01:54:16,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 824 [2021-08-31 01:54:16,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 824 [2021-08-31 01:54:16,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 824 states and 991 transitions. [2021-08-31 01:54:16,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:16,257 INFO L681 BuchiCegarLoop]: Abstraction has 824 states and 991 transitions. [2021-08-31 01:54:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states and 991 transitions. [2021-08-31 01:54:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 534. [2021-08-31 01:54:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 534 states have (on average 1.2359550561797752) internal successors, (660), 533 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 660 transitions. [2021-08-31 01:54:16,266 INFO L704 BuchiCegarLoop]: Abstraction has 534 states and 660 transitions. [2021-08-31 01:54:16,266 INFO L587 BuchiCegarLoop]: Abstraction has 534 states and 660 transitions. [2021-08-31 01:54:16,266 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-08-31 01:54:16,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 534 states and 660 transitions. [2021-08-31 01:54:16,268 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 490 [2021-08-31 01:54:16,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:16,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:16,269 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:16,269 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:16,269 INFO L791 eck$LassoCheckResult]: Stem: 13503#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 13491#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 13481#L51 assume !(0 == mp_add_~a3~0 % 256); 13482#L51-1 mp_add_~nb~0 := 4; 13483#L61 assume !(0 == mp_add_~b3~0 % 256); 13484#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 13500#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13712#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 13702#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 13703#L76-2 assume !(1 == mp_add_~i~0 % 256); 13751#L77-1 assume !(2 == mp_add_~i~0 % 256); 13750#L78-1 assume !(3 == mp_add_~i~0 % 256); 13672#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 13673#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 13666#L82-2 assume !(1 == mp_add_~i~0 % 256); 13667#L83-1 assume !(2 == mp_add_~i~0 % 256); 13660#L84-1 assume !(3 == mp_add_~i~0 % 256); 13661#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 13656#L87-1 [2021-08-31 01:54:16,270 INFO L793 eck$LassoCheckResult]: Loop: 13656#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 13655#L91-1 assume !(1 == mp_add_~i~0 % 256); 13654#L92-1 assume !(2 == mp_add_~i~0 % 256); 13653#L93-1 assume !(3 == mp_add_~i~0 % 256); 13652#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 13650#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13647#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 13648#L76 assume !(0 == mp_add_~i~0 % 256); 13636#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 13634#L77-1 assume !(2 == mp_add_~i~0 % 256); 13632#L78-1 assume !(3 == mp_add_~i~0 % 256); 13628#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 13624#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 13622#L87-1 assume !(0 == mp_add_~i~0 % 256); 13620#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 13618#L92-1 assume !(2 == mp_add_~i~0 % 256); 13615#L93-1 assume !(3 == mp_add_~i~0 % 256); 13613#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 13611#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13608#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 13606#L76 assume !(0 == mp_add_~i~0 % 256); 13603#L76-2 assume !(1 == mp_add_~i~0 % 256); 13602#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 13600#L78-1 assume !(3 == mp_add_~i~0 % 256); 13597#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 13594#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 13593#L87-1 assume !(0 == mp_add_~i~0 % 256); 13592#L91-1 assume !(1 == mp_add_~i~0 % 256); 13591#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 13590#L93-1 assume !(3 == mp_add_~i~0 % 256); 13589#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 13588#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13586#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 13585#L76 assume !(0 == mp_add_~i~0 % 256); 13583#L76-2 assume !(1 == mp_add_~i~0 % 256); 13582#L77-1 assume !(2 == mp_add_~i~0 % 256); 13580#L78-1 assume !(3 == mp_add_~i~0 % 256); 13581#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 13720#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 13719#L87-1 assume !(0 == mp_add_~i~0 % 256); 13714#L91-1 assume !(1 == mp_add_~i~0 % 256); 13713#L92-1 assume !(2 == mp_add_~i~0 % 256); 13711#L93-1 assume !(3 == mp_add_~i~0 % 256); 13708#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 13707#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13705#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 13704#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 13699#L76-2 assume !(1 == mp_add_~i~0 % 256); 13697#L77-1 assume !(2 == mp_add_~i~0 % 256); 13695#L78-1 assume !(3 == mp_add_~i~0 % 256); 13696#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 13669#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 13670#L82-2 assume !(1 == mp_add_~i~0 % 256); 13663#L83-1 assume !(2 == mp_add_~i~0 % 256); 13664#L84-1 assume !(3 == mp_add_~i~0 % 256); 13657#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 13656#L87-1 [2021-08-31 01:54:16,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 14 times [2021-08-31 01:54:16,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:16,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616670340] [2021-08-31 01:54:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:16,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:16,280 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:16,290 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:16,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1112443543, now seen corresponding path program 1 times [2021-08-31 01:54:16,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:16,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221103330] [2021-08-31 01:54:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:16,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-31 01:54:16,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:16,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221103330] [2021-08-31 01:54:16,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221103330] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:54:16,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518676337] [2021-08-31 01:54:16,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:16,356 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:54:16,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:54:16,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:54:16,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-31 01:54:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:16,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-31 01:54:16,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:54:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 57 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-31 01:54:16,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:54:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 57 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-31 01:54:16,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518676337] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:54:16,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:54:16,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 9 [2021-08-31 01:54:16,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648421034] [2021-08-31 01:54:16,777 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:16,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:16,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-31 01:54:16,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-31 01:54:16,777 INFO L87 Difference]: Start difference. First operand 534 states and 660 transitions. cyclomatic complexity: 130 Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:17,190 INFO L93 Difference]: Finished difference Result 405 states and 466 transitions. [2021-08-31 01:54:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-31 01:54:17,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 405 states and 466 transitions. [2021-08-31 01:54:17,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 315 [2021-08-31 01:54:17,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 405 states to 371 states and 419 transitions. [2021-08-31 01:54:17,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 371 [2021-08-31 01:54:17,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2021-08-31 01:54:17,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 419 transitions. [2021-08-31 01:54:17,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:17,195 INFO L681 BuchiCegarLoop]: Abstraction has 371 states and 419 transitions. [2021-08-31 01:54:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 419 transitions. [2021-08-31 01:54:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 257. [2021-08-31 01:54:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 257 states have (on average 1.132295719844358) internal successors, (291), 256 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 291 transitions. [2021-08-31 01:54:17,199 INFO L704 BuchiCegarLoop]: Abstraction has 257 states and 291 transitions. [2021-08-31 01:54:17,199 INFO L587 BuchiCegarLoop]: Abstraction has 257 states and 291 transitions. [2021-08-31 01:54:17,199 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-08-31 01:54:17,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 257 states and 291 transitions. [2021-08-31 01:54:17,200 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 207 [2021-08-31 01:54:17,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:17,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:17,202 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:17,202 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:17,202 INFO L791 eck$LassoCheckResult]: Stem: 14791#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 14783#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 14774#L51 assume !(0 == mp_add_~a3~0 % 256); 14775#L51-1 mp_add_~nb~0 := 4; 14776#L61 assume !(0 == mp_add_~b3~0 % 256); 14777#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 14862#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14863#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14858#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 14859#L76-2 assume !(1 == mp_add_~i~0 % 256); 14854#L77-1 assume !(2 == mp_add_~i~0 % 256); 14855#L78-1 assume !(3 == mp_add_~i~0 % 256); 14851#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14850#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 14849#L82-2 assume !(1 == mp_add_~i~0 % 256); 14848#L83-1 assume !(2 == mp_add_~i~0 % 256); 14847#L84-1 assume !(3 == mp_add_~i~0 % 256); 14845#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14844#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 14843#L91-1 assume !(1 == mp_add_~i~0 % 256); 14842#L92-1 assume !(2 == mp_add_~i~0 % 256); 14841#L93-1 assume !(3 == mp_add_~i~0 % 256); 14840#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14839#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14838#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 14797#L75-1 [2021-08-31 01:54:17,202 INFO L793 eck$LassoCheckResult]: Loop: 14797#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 14796#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 14786#L87-1 assume !(0 == mp_add_~i~0 % 256); 14780#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 14781#L92-1 assume !(2 == mp_add_~i~0 % 256); 14782#L93-1 assume !(3 == mp_add_~i~0 % 256); 14790#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15028#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15027#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 14916#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15024#L82 assume !(0 == mp_add_~i~0 % 256); 15023#L82-2 assume !(1 == mp_add_~i~0 % 256); 15022#L83-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 15021#L84-1 assume !(3 == mp_add_~i~0 % 256); 14994#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 14989#L87-1 assume !(0 == mp_add_~i~0 % 256); 15012#L91-1 assume !(1 == mp_add_~i~0 % 256); 15010#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 15011#L93-1 assume !(3 == mp_add_~i~0 % 256); 15020#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15019#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15018#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15017#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15016#L82 assume !(0 == mp_add_~i~0 % 256); 15015#L82-2 assume !(1 == mp_add_~i~0 % 256); 15014#L83-1 assume !(2 == mp_add_~i~0 % 256); 15013#L84-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 14980#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 14974#L87-1 assume !(0 == mp_add_~i~0 % 256); 15009#L91-1 assume !(1 == mp_add_~i~0 % 256); 15008#L92-1 assume !(2 == mp_add_~i~0 % 256); 15007#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 14787#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14784#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14785#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 14801#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14965#L82 assume !(0 == mp_add_~i~0 % 256); 14802#L82-2 assume !(1 == mp_add_~i~0 % 256); 14803#L83-1 assume !(2 == mp_add_~i~0 % 256); 14963#L84-1 assume !(3 == mp_add_~i~0 % 256); 14962#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 14961#L87-1 assume !(0 == mp_add_~i~0 % 256); 14960#L91-1 assume !(1 == mp_add_~i~0 % 256); 14959#L92-1 assume !(2 == mp_add_~i~0 % 256); 14958#L93-1 assume !(3 == mp_add_~i~0 % 256); 14957#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14956#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14954#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14937#L76 assume !(0 == mp_add_~i~0 % 256); 14936#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 14794#L77-1 assume !(2 == mp_add_~i~0 % 256); 14795#L78-1 assume !(3 == mp_add_~i~0 % 256); 14797#L75-1 [2021-08-31 01:54:17,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:17,203 INFO L82 PathProgramCache]: Analyzing trace with hash 569206483, now seen corresponding path program 1 times [2021-08-31 01:54:17,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:17,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865030923] [2021-08-31 01:54:17,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:17,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:17,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:17,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865030923] [2021-08-31 01:54:17,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865030923] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:54:17,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125756469] [2021-08-31 01:54:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:17,286 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:54:17,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:54:17,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:54:17,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-31 01:54:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:17,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 01:54:17,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:54:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:17,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 01:54:17,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125756469] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:17,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-31 01:54:17,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-08-31 01:54:17,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376273669] [2021-08-31 01:54:17,574 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:54:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:17,575 INFO L82 PathProgramCache]: Analyzing trace with hash -488820255, now seen corresponding path program 1 times [2021-08-31 01:54:17,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:17,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298357286] [2021-08-31 01:54:17,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:17,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-31 01:54:17,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:17,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298357286] [2021-08-31 01:54:17,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298357286] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:17,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:17,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 01:54:17,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125145982] [2021-08-31 01:54:17,624 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:17,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:17,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 01:54:17,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-31 01:54:17,624 INFO L87 Difference]: Start difference. First operand 257 states and 291 transitions. cyclomatic complexity: 36 Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:17,728 INFO L93 Difference]: Finished difference Result 276 states and 311 transitions. [2021-08-31 01:54:17,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 01:54:17,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 276 states and 311 transitions. [2021-08-31 01:54:17,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 207 [2021-08-31 01:54:17,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 276 states to 276 states and 311 transitions. [2021-08-31 01:54:17,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 276 [2021-08-31 01:54:17,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 276 [2021-08-31 01:54:17,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 276 states and 311 transitions. [2021-08-31 01:54:17,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:17,732 INFO L681 BuchiCegarLoop]: Abstraction has 276 states and 311 transitions. [2021-08-31 01:54:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states and 311 transitions. [2021-08-31 01:54:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 257. [2021-08-31 01:54:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 257 states have (on average 1.1284046692607004) internal successors, (290), 256 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 290 transitions. [2021-08-31 01:54:17,736 INFO L704 BuchiCegarLoop]: Abstraction has 257 states and 290 transitions. [2021-08-31 01:54:17,736 INFO L587 BuchiCegarLoop]: Abstraction has 257 states and 290 transitions. [2021-08-31 01:54:17,736 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-08-31 01:54:17,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 257 states and 290 transitions. [2021-08-31 01:54:17,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 207 [2021-08-31 01:54:17,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:17,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:17,738 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:17,738 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:17,738 INFO L791 eck$LassoCheckResult]: Stem: 15408#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 15404#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 15396#L51 assume !(0 == mp_add_~a3~0 % 256); 15397#L51-1 mp_add_~nb~0 := 4; 15398#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 15400#L63 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 15401#L65 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 15423#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 15507#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15483#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15484#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 15478#L76-2 assume !(1 == mp_add_~i~0 % 256); 15476#L77-1 assume !(2 == mp_add_~i~0 % 256); 15472#L78-1 assume !(3 == mp_add_~i~0 % 256); 15473#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15496#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15464#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 15492#L91-1 assume !(1 == mp_add_~i~0 % 256); 15493#L92-1 assume !(2 == mp_add_~i~0 % 256); 15519#L93-1 assume !(3 == mp_add_~i~0 % 256); 15517#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15515#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15485#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15482#L76 assume !(0 == mp_add_~i~0 % 256); 15479#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 15477#L77-1 [2021-08-31 01:54:17,738 INFO L793 eck$LassoCheckResult]: Loop: 15477#L77-1 assume !(2 == mp_add_~i~0 % 256); 15474#L78-1 assume !(3 == mp_add_~i~0 % 256); 15470#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15448#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15444#L87-1 assume !(0 == mp_add_~i~0 % 256); 15445#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 15440#L92-1 assume !(2 == mp_add_~i~0 % 256); 15441#L93-1 assume !(3 == mp_add_~i~0 % 256); 15562#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15435#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15436#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15430#L76 assume !(0 == mp_add_~i~0 % 256); 15431#L76-2 assume !(1 == mp_add_~i~0 % 256); 15426#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 15427#L78-1 assume !(3 == mp_add_~i~0 % 256); 15561#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15555#L82 assume !(0 == mp_add_~i~0 % 256); 15559#L82-2 assume !(1 == mp_add_~i~0 % 256); 15557#L83-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 15553#L84-1 assume !(3 == mp_add_~i~0 % 256); 15550#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 15548#L87-1 assume !(0 == mp_add_~i~0 % 256); 15546#L91-1 assume !(1 == mp_add_~i~0 % 256); 15544#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 15541#L93-1 assume !(3 == mp_add_~i~0 % 256); 15539#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15537#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15535#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15531#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15525#L82 assume !(0 == mp_add_~i~0 % 256); 15528#L82-2 assume !(1 == mp_add_~i~0 % 256); 15526#L83-1 assume !(2 == mp_add_~i~0 % 256); 15523#L84-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 15521#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 15520#L87-1 assume !(0 == mp_add_~i~0 % 256); 15518#L91-1 assume !(1 == mp_add_~i~0 % 256); 15516#L92-1 assume !(2 == mp_add_~i~0 % 256); 15514#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 15513#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15511#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15504#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15499#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15497#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15494#L87-1 assume !(0 == mp_add_~i~0 % 256); 15495#L91-1 assume !(1 == mp_add_~i~0 % 256); 15491#L92-1 assume !(2 == mp_add_~i~0 % 256); 15490#L93-1 assume !(3 == mp_add_~i~0 % 256); 15489#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15487#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15488#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15510#L76 assume !(0 == mp_add_~i~0 % 256); 15509#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 15477#L77-1 [2021-08-31 01:54:17,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:17,739 INFO L82 PathProgramCache]: Analyzing trace with hash -311032260, now seen corresponding path program 1 times [2021-08-31 01:54:17,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:17,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691729417] [2021-08-31 01:54:17,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:17,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:54:17,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:17,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691729417] [2021-08-31 01:54:17,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691729417] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:17,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:17,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-31 01:54:17,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195304555] [2021-08-31 01:54:17,805 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:54:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1748735739, now seen corresponding path program 1 times [2021-08-31 01:54:17,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:17,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394099350] [2021-08-31 01:54:17,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:17,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-31 01:54:17,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:17,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394099350] [2021-08-31 01:54:17,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394099350] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:54:17,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903656254] [2021-08-31 01:54:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:17,853 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:54:17,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:54:17,894 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:54:17,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-31 01:54:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:17,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 01:54:17,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:54:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-31 01:54:18,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 01:54:18,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903656254] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:18,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-31 01:54:18,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-08-31 01:54:18,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647537334] [2021-08-31 01:54:18,061 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:18,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:18,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 01:54:18,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-31 01:54:18,062 INFO L87 Difference]: Start difference. First operand 257 states and 290 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:18,609 INFO L93 Difference]: Finished difference Result 971 states and 1090 transitions. [2021-08-31 01:54:18,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-31 01:54:18,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 971 states and 1090 transitions. [2021-08-31 01:54:18,614 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 828 [2021-08-31 01:54:18,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 971 states to 971 states and 1090 transitions. [2021-08-31 01:54:18,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 971 [2021-08-31 01:54:18,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 971 [2021-08-31 01:54:18,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 971 states and 1090 transitions. [2021-08-31 01:54:18,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:18,620 INFO L681 BuchiCegarLoop]: Abstraction has 971 states and 1090 transitions. [2021-08-31 01:54:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states and 1090 transitions. [2021-08-31 01:54:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 248. [2021-08-31 01:54:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 248 states have (on average 1.1290322580645162) internal successors, (280), 247 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 280 transitions. [2021-08-31 01:54:18,628 INFO L704 BuchiCegarLoop]: Abstraction has 248 states and 280 transitions. [2021-08-31 01:54:18,629 INFO L587 BuchiCegarLoop]: Abstraction has 248 states and 280 transitions. [2021-08-31 01:54:18,629 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-08-31 01:54:18,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 280 transitions. [2021-08-31 01:54:18,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 207 [2021-08-31 01:54:18,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:18,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:18,631 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:18,631 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:18,631 INFO L791 eck$LassoCheckResult]: Stem: 16815#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 16809#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 16801#L51 assume !(0 == mp_add_~a3~0 % 256); 16802#L51-1 mp_add_~nb~0 := 4; 16803#L61 assume !(0 == mp_add_~b3~0 % 256); 16804#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 16813#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16880#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16879#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 16878#L76-2 assume !(1 == mp_add_~i~0 % 256); 16877#L77-1 assume !(2 == mp_add_~i~0 % 256); 16876#L78-1 assume !(3 == mp_add_~i~0 % 256); 16875#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16874#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 16873#L82-2 assume !(1 == mp_add_~i~0 % 256); 16872#L83-1 assume !(2 == mp_add_~i~0 % 256); 16871#L84-1 assume !(3 == mp_add_~i~0 % 256); 16869#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 16870#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 16894#L91-1 assume !(1 == mp_add_~i~0 % 256); 16890#L92-1 assume !(2 == mp_add_~i~0 % 256); 16891#L93-1 assume !(3 == mp_add_~i~0 % 256); 16886#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16887#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16910#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16909#L76 assume !(0 == mp_add_~i~0 % 256); 16860#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 16858#L77-1 [2021-08-31 01:54:18,631 INFO L793 eck$LassoCheckResult]: Loop: 16858#L77-1 assume !(2 == mp_add_~i~0 % 256); 16855#L78-1 assume !(3 == mp_add_~i~0 % 256); 16852#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 16848#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 16845#L87-1 assume !(0 == mp_add_~i~0 % 256); 16844#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 16842#L92-1 assume !(2 == mp_add_~i~0 % 256); 16843#L93-1 assume !(3 == mp_add_~i~0 % 256); 16839#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16838#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16835#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16836#L76 assume !(0 == mp_add_~i~0 % 256); 16983#L76-2 assume !(1 == mp_add_~i~0 % 256); 16830#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 16831#L78-1 assume !(3 == mp_add_~i~0 % 256); 16972#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16962#L82 assume !(0 == mp_add_~i~0 % 256); 16969#L82-2 assume !(1 == mp_add_~i~0 % 256); 16965#L83-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 16960#L84-1 assume !(3 == mp_add_~i~0 % 256); 16956#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 16953#L87-1 assume !(0 == mp_add_~i~0 % 256); 16949#L91-1 assume !(1 == mp_add_~i~0 % 256); 16945#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 16942#L93-1 assume !(3 == mp_add_~i~0 % 256); 16941#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16939#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16937#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 16933#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 16929#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 16922#L87-1 assume !(0 == mp_add_~i~0 % 256); 16923#L91-1 assume !(1 == mp_add_~i~0 % 256); 16920#L92-1 assume !(2 == mp_add_~i~0 % 256); 16918#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 16916#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16914#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16911#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 16912#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16899#L82 assume !(0 == mp_add_~i~0 % 256); 16904#L82-2 assume !(1 == mp_add_~i~0 % 256); 16900#L83-1 assume !(2 == mp_add_~i~0 % 256); 16897#L84-1 assume !(3 == mp_add_~i~0 % 256); 16896#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 16895#L87-1 assume !(0 == mp_add_~i~0 % 256); 16892#L91-1 assume !(1 == mp_add_~i~0 % 256); 16893#L92-1 assume !(2 == mp_add_~i~0 % 256); 16888#L93-1 assume !(3 == mp_add_~i~0 % 256); 16889#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16885#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16883#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16881#L76 assume !(0 == mp_add_~i~0 % 256); 16882#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 16858#L77-1 [2021-08-31 01:54:18,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1153533403, now seen corresponding path program 1 times [2021-08-31 01:54:18,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:18,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560343691] [2021-08-31 01:54:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:18,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:18,645 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:18,666 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:18,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:18,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1964388385, now seen corresponding path program 1 times [2021-08-31 01:54:18,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:18,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065164381] [2021-08-31 01:54:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:18,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-31 01:54:18,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:18,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065164381] [2021-08-31 01:54:18,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065164381] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:54:18,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:54:18,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-31 01:54:18,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958615397] [2021-08-31 01:54:18,713 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:54:18,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:54:18,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-31 01:54:18,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-31 01:54:18,714 INFO L87 Difference]: Start difference. First operand 248 states and 280 transitions. cyclomatic complexity: 34 Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:54:18,873 INFO L93 Difference]: Finished difference Result 499 states and 554 transitions. [2021-08-31 01:54:18,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 01:54:18,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 499 states and 554 transitions. [2021-08-31 01:54:18,876 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 375 [2021-08-31 01:54:18,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 499 states to 499 states and 554 transitions. [2021-08-31 01:54:18,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 499 [2021-08-31 01:54:18,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 499 [2021-08-31 01:54:18,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 499 states and 554 transitions. [2021-08-31 01:54:18,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:54:18,881 INFO L681 BuchiCegarLoop]: Abstraction has 499 states and 554 transitions. [2021-08-31 01:54:18,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states and 554 transitions. [2021-08-31 01:54:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 436. [2021-08-31 01:54:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 436 states have (on average 1.121559633027523) internal successors, (489), 435 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:54:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 489 transitions. [2021-08-31 01:54:18,889 INFO L704 BuchiCegarLoop]: Abstraction has 436 states and 489 transitions. [2021-08-31 01:54:18,889 INFO L587 BuchiCegarLoop]: Abstraction has 436 states and 489 transitions. [2021-08-31 01:54:18,889 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-08-31 01:54:18,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 436 states and 489 transitions. [2021-08-31 01:54:18,891 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 328 [2021-08-31 01:54:18,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:54:18,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:54:18,891 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:18,891 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:54:18,892 INFO L791 eck$LassoCheckResult]: Stem: 17571#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 17566#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 17558#L51 assume !(0 == mp_add_~a3~0 % 256); 17559#L51-1 mp_add_~nb~0 := 4; 17560#L61 assume !(0 == mp_add_~b3~0 % 256); 17561#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 17569#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 17644#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 17643#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 17642#L76-2 assume !(1 == mp_add_~i~0 % 256); 17641#L77-1 assume !(2 == mp_add_~i~0 % 256); 17640#L78-1 assume !(3 == mp_add_~i~0 % 256); 17639#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 17638#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 17637#L82-2 assume !(1 == mp_add_~i~0 % 256); 17636#L83-1 assume !(2 == mp_add_~i~0 % 256); 17635#L84-1 assume !(3 == mp_add_~i~0 % 256); 17633#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 17634#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 17761#L91-1 assume !(1 == mp_add_~i~0 % 256); 17782#L92-1 assume !(2 == mp_add_~i~0 % 256); 17781#L93-1 assume !(3 == mp_add_~i~0 % 256); 17725#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 17726#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 17662#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 17663#L76 assume !(0 == mp_add_~i~0 % 256); 17627#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 17625#L77-1 [2021-08-31 01:54:18,892 INFO L793 eck$LassoCheckResult]: Loop: 17625#L77-1 assume !(2 == mp_add_~i~0 % 256); 17623#L78-1 assume !(3 == mp_add_~i~0 % 256); 17621#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 17614#L82 assume !(0 == mp_add_~i~0 % 256); 17618#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 17616#L83-1 assume !(2 == mp_add_~i~0 % 256); 17612#L84-1 assume !(3 == mp_add_~i~0 % 256); 17608#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 17609#L87-1 assume !(0 == mp_add_~i~0 % 256); 17604#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 17605#L92-1 assume !(2 == mp_add_~i~0 % 256); 17600#L93-1 assume !(3 == mp_add_~i~0 % 256); 17601#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 17596#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 17597#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 17592#L76 assume !(0 == mp_add_~i~0 % 256); 17593#L76-2 assume !(1 == mp_add_~i~0 % 256); 17588#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 17589#L78-1 assume !(3 == mp_add_~i~0 % 256); 17844#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 17836#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 17833#L87-1 assume !(0 == mp_add_~i~0 % 256); 17831#L91-1 assume !(1 == mp_add_~i~0 % 256); 17827#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 17819#L93-1 assume !(3 == mp_add_~i~0 % 256); 17808#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 17806#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 17804#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 17800#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 17794#L82 assume !(0 == mp_add_~i~0 % 256); 17797#L82-2 assume !(1 == mp_add_~i~0 % 256); 17795#L83-1 assume !(2 == mp_add_~i~0 % 256); 17792#L84-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 17789#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 17787#L87-1 assume !(0 == mp_add_~i~0 % 256); 17785#L91-1 assume !(1 == mp_add_~i~0 % 256); 17784#L92-1 assume !(2 == mp_add_~i~0 % 256); 17783#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 17775#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 17773#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 17769#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 17765#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 17763#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 17762#L87-1 assume !(0 == mp_add_~i~0 % 256); 17760#L91-1 assume !(1 == mp_add_~i~0 % 256); 17759#L92-1 assume !(2 == mp_add_~i~0 % 256); 17757#L93-1 assume !(3 == mp_add_~i~0 % 256); 17758#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 17668#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 17669#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 17659#L76 assume !(0 == mp_add_~i~0 % 256); 17660#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 17625#L77-1 [2021-08-31 01:54:18,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:18,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1153533403, now seen corresponding path program 2 times [2021-08-31 01:54:18,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:18,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660965775] [2021-08-31 01:54:18,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:18,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:18,904 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:54:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:54:18,921 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:54:18,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:54:18,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1482092587, now seen corresponding path program 1 times [2021-08-31 01:54:18,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:54:18,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81879718] [2021-08-31 01:54:18,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:18,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:54:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 53 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-31 01:54:18,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:54:18,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81879718] [2021-08-31 01:54:18,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81879718] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:54:18,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760942107] [2021-08-31 01:54:18,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:54:18,954 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:54:18,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:54:18,960 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:54:18,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-31 01:54:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:54:18,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 01:54:19,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:54:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 52 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-31 01:54:19,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:55:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 52 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-31 01:55:17,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760942107] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:55:17,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:55:17,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-08-31 01:55:17,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430589569] [2021-08-31 01:55:17,193 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:55:17,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:55:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-31 01:55:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=66, Unknown=3, NotChecked=0, Total=90 [2021-08-31 01:55:17,194 INFO L87 Difference]: Start difference. First operand 436 states and 489 transitions. cyclomatic complexity: 57 Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:55:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:55:43,072 INFO L93 Difference]: Finished difference Result 732 states and 805 transitions. [2021-08-31 01:55:43,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-31 01:55:43,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 732 states and 805 transitions. [2021-08-31 01:55:43,076 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 511 [2021-08-31 01:55:43,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 732 states to 676 states and 739 transitions. [2021-08-31 01:55:43,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 676 [2021-08-31 01:55:43,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 676 [2021-08-31 01:55:43,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 676 states and 739 transitions. [2021-08-31 01:55:43,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:55:43,080 INFO L681 BuchiCegarLoop]: Abstraction has 676 states and 739 transitions. [2021-08-31 01:55:43,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states and 739 transitions. [2021-08-31 01:55:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 505. [2021-08-31 01:55:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 505 states have (on average 1.114851485148515) internal successors, (563), 504 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:55:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 563 transitions. [2021-08-31 01:55:43,088 INFO L704 BuchiCegarLoop]: Abstraction has 505 states and 563 transitions. [2021-08-31 01:55:43,088 INFO L587 BuchiCegarLoop]: Abstraction has 505 states and 563 transitions. [2021-08-31 01:55:43,088 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-08-31 01:55:43,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 505 states and 563 transitions. [2021-08-31 01:55:43,090 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 430 [2021-08-31 01:55:43,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:55:43,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:55:43,091 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:55:43,091 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 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] [2021-08-31 01:55:43,091 INFO L791 eck$LassoCheckResult]: Stem: 19113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 19109#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 19101#L51 assume !(0 == mp_add_~a3~0 % 256); 19102#L51-1 mp_add_~nb~0 := 4; 19103#L61 assume !(0 == mp_add_~b3~0 % 256); 19104#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 19112#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19362#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 19361#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 19360#L76-2 assume !(1 == mp_add_~i~0 % 256); 19359#L77-1 assume !(2 == mp_add_~i~0 % 256); 19358#L78-1 assume !(3 == mp_add_~i~0 % 256); 19357#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19356#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 19355#L82-2 assume !(1 == mp_add_~i~0 % 256); 19354#L83-1 assume !(2 == mp_add_~i~0 % 256); 19353#L84-1 assume !(3 == mp_add_~i~0 % 256); 19351#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 19352#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 19546#L91-1 assume !(1 == mp_add_~i~0 % 256); 19545#L92-1 assume !(2 == mp_add_~i~0 % 256); 19544#L93-1 assume !(3 == mp_add_~i~0 % 256); 19543#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19542#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19541#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 19540#L76 assume !(0 == mp_add_~i~0 % 256); 19539#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 19230#L77-1 [2021-08-31 01:55:43,091 INFO L793 eck$LassoCheckResult]: Loop: 19230#L77-1 assume !(2 == mp_add_~i~0 % 256); 19538#L78-1 assume !(3 == mp_add_~i~0 % 256); 19185#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19184#L82 assume !(0 == mp_add_~i~0 % 256); 19183#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 19182#L83-1 assume !(2 == mp_add_~i~0 % 256); 19181#L84-1 assume !(3 == mp_add_~i~0 % 256); 19179#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 19175#L87-1 assume !(0 == mp_add_~i~0 % 256); 19176#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 19167#L92-1 assume !(2 == mp_add_~i~0 % 256); 19168#L93-1 assume !(3 == mp_add_~i~0 % 256); 19159#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19160#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19151#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 19152#L76 assume !(0 == mp_add_~i~0 % 256); 19496#L76-2 assume !(1 == mp_add_~i~0 % 256); 19495#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 19494#L78-1 assume !(3 == mp_add_~i~0 % 256); 19321#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19320#L82 assume !(0 == mp_add_~i~0 % 256); 19319#L82-2 assume !(1 == mp_add_~i~0 % 256); 19318#L83-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 19317#L84-1 assume !(3 == mp_add_~i~0 % 256); 19316#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19314#L87-1 assume !(0 == mp_add_~i~0 % 256); 19311#L91-1 assume !(1 == mp_add_~i~0 % 256); 19308#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 19305#L93-1 assume !(3 == mp_add_~i~0 % 256); 19302#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19299#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19293#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19294#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19254#L82 assume !(0 == mp_add_~i~0 % 256); 19375#L82-2 assume !(1 == mp_add_~i~0 % 256); 19374#L83-1 assume !(2 == mp_add_~i~0 % 256); 19369#L84-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 19367#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19365#L87-1 assume !(0 == mp_add_~i~0 % 256); 19363#L91-1 assume !(1 == mp_add_~i~0 % 256); 19349#L92-1 assume !(2 == mp_add_~i~0 % 256); 19345#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 19341#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19283#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19284#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19338#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19335#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 19333#L87-1 assume !(0 == mp_add_~i~0 % 256); 19331#L91-1 assume !(1 == mp_add_~i~0 % 256); 19329#L92-1 assume !(2 == mp_add_~i~0 % 256); 19327#L93-1 assume !(3 == mp_add_~i~0 % 256); 19247#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19244#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19238#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 19234#L76 assume !(0 == mp_add_~i~0 % 256); 19229#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 19230#L77-1 [2021-08-31 01:55:43,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:55:43,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1153533403, now seen corresponding path program 3 times [2021-08-31 01:55:43,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:55:43,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648148178] [2021-08-31 01:55:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:55:43,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:55:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:55:43,117 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:55:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:55:43,130 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:55:43,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:55:43,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1012546635, now seen corresponding path program 1 times [2021-08-31 01:55:43,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:55:43,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606445063] [2021-08-31 01:55:43,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:55:43,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:55:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:55:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:55:43,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:55:43,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606445063] [2021-08-31 01:55:43,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606445063] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:55:43,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694448850] [2021-08-31 01:55:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:55:43,250 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:55:43,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:43,252 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:55:43,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-31 01:55:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:55:43,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-31 01:55:43,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:55:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-31 01:55:43,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:55:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-31 01:55:43,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694448850] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:55:43,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:55:43,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2021-08-31 01:55:43,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860536271] [2021-08-31 01:55:43,918 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 01:55:43,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:55:43,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-31 01:55:43,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-08-31 01:55:43,919 INFO L87 Difference]: Start difference. First operand 505 states and 563 transitions. cyclomatic complexity: 63 Second operand has 14 states, 13 states have (on average 9.538461538461538) internal successors, (124), 14 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:55:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:55:46,655 INFO L93 Difference]: Finished difference Result 687 states and 742 transitions. [2021-08-31 01:55:46,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-31 01:55:46,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 687 states and 742 transitions. [2021-08-31 01:55:46,660 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 124 [2021-08-31 01:55:46,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 687 states to 685 states and 740 transitions. [2021-08-31 01:55:46,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 685 [2021-08-31 01:55:46,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 685 [2021-08-31 01:55:46,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 685 states and 740 transitions. [2021-08-31 01:55:46,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:55:46,663 INFO L681 BuchiCegarLoop]: Abstraction has 685 states and 740 transitions. [2021-08-31 01:55:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states and 740 transitions. [2021-08-31 01:55:46,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 425. [2021-08-31 01:55:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 425 states have (on average 1.108235294117647) internal successors, (471), 424 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:55:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 471 transitions. [2021-08-31 01:55:46,671 INFO L704 BuchiCegarLoop]: Abstraction has 425 states and 471 transitions. [2021-08-31 01:55:46,671 INFO L587 BuchiCegarLoop]: Abstraction has 425 states and 471 transitions. [2021-08-31 01:55:46,671 INFO L425 BuchiCegarLoop]: ======== Iteration 27============ [2021-08-31 01:55:46,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 425 states and 471 transitions. [2021-08-31 01:55:46,673 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2021-08-31 01:55:46,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:55:46,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:55:46,674 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:55:46,674 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:55:46,674 INFO L791 eck$LassoCheckResult]: Stem: 20703#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 20699#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 20690#L51 assume !(0 == mp_add_~a3~0 % 256); 20691#L51-1 mp_add_~nb~0 := 4; 20692#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 20694#L63 assume !(0 == mp_add_~b2~0 % 256); 20695#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 20702#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20748#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20747#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 20746#L76-2 assume !(1 == mp_add_~i~0 % 256); 20745#L77-1 assume !(2 == mp_add_~i~0 % 256); 20744#L78-1 assume !(3 == mp_add_~i~0 % 256); 20742#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 20743#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 20738#L82-2 assume !(1 == mp_add_~i~0 % 256); 20739#L83-1 assume !(2 == mp_add_~i~0 % 256); 20734#L84-1 assume !(3 == mp_add_~i~0 % 256); 20735#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 20824#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 20822#L91-1 assume !(1 == mp_add_~i~0 % 256); 20820#L92-1 assume !(2 == mp_add_~i~0 % 256); 20818#L93-1 assume !(3 == mp_add_~i~0 % 256); 20816#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20814#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20812#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20810#L76 assume !(0 == mp_add_~i~0 % 256); 20808#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 20806#L77-1 assume !(2 == mp_add_~i~0 % 256); 20804#L78-1 assume !(3 == mp_add_~i~0 % 256); 20801#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 20798#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 20797#L87-1 assume !(0 == mp_add_~i~0 % 256); 20795#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 20796#L92-1 assume !(2 == mp_add_~i~0 % 256); 20791#L93-1 assume !(3 == mp_add_~i~0 % 256); 20792#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20787#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20788#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20783#L76 assume !(0 == mp_add_~i~0 % 256); 20784#L76-2 assume !(1 == mp_add_~i~0 % 256); 20779#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 20780#L78-1 assume !(3 == mp_add_~i~0 % 256); 20889#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 20867#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 20868#L87-1 assume !(0 == mp_add_~i~0 % 256); 20863#L91-1 assume !(1 == mp_add_~i~0 % 256); 20864#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 20859#L93-1 assume !(3 == mp_add_~i~0 % 256); 20860#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20855#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20856#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 20834#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 20959#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 20946#L87-1 assume !(0 == mp_add_~i~0 % 256); 20958#L91-1 assume !(1 == mp_add_~i~0 % 256); 20957#L92-1 assume !(2 == mp_add_~i~0 % 256); 20955#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 20954#L94-1 [2021-08-31 01:55:46,674 INFO L793 eck$LassoCheckResult]: Loop: 20954#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20953#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20907#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20904#L76 assume !(0 == mp_add_~i~0 % 256); 20903#L76-2 assume !(1 == mp_add_~i~0 % 256); 20869#L77-1 assume !(2 == mp_add_~i~0 % 256); 20835#L78-1 assume !(3 == mp_add_~i~0 % 256); 20836#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 20964#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 20963#L87-1 assume !(0 == mp_add_~i~0 % 256); 20962#L91-1 assume !(1 == mp_add_~i~0 % 256); 20961#L92-1 assume !(2 == mp_add_~i~0 % 256); 20956#L93-1 assume !(3 == mp_add_~i~0 % 256); 20954#L94-1 [2021-08-31 01:55:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:55:46,675 INFO L82 PathProgramCache]: Analyzing trace with hash -584794870, now seen corresponding path program 1 times [2021-08-31 01:55:46,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:55:46,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695772454] [2021-08-31 01:55:46,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:55:46,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:55:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:55:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 37 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-31 01:55:46,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:55:46,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695772454] [2021-08-31 01:55:46,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695772454] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:55:46,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139230827] [2021-08-31 01:55:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:55:46,837 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:55:46,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:46,841 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:55:46,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-31 01:55:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:55:46,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-31 01:55:46,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:55:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-31 01:55:47,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:55:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-31 01:55:47,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139230827] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:55:47,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:55:47,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 13 [2021-08-31 01:55:47,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130418673] [2021-08-31 01:55:47,798 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:55:47,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:55:47,798 INFO L82 PathProgramCache]: Analyzing trace with hash 672830572, now seen corresponding path program 1 times [2021-08-31 01:55:47,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:55:47,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546569253] [2021-08-31 01:55:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:55:47,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:55:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:55:47,803 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:55:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:55:47,806 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:55:48,048 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:55:48,049 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:55:48,049 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:55:48,049 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:55:48,049 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 01:55:48,049 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:48,049 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:55:48,050 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:55:48,050 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration27_Loop [2021-08-31 01:55:48,050 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:55:48,050 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:55:48,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:55:48,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:55:48,514 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:55:48,514 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 01:55:48,516 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:48,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:48,517 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) [2021-08-31 01:55:48,517 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 [2021-08-31 01:55:48,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:55:48,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:55:48,535 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 01:55:48,535 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 01:55:48,556 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 [2021-08-31 01:55:48,557 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:48,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:48,558 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) [2021-08-31 01:55:48,559 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 [2021-08-31 01:55:48,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:55:48,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:55:48,614 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 [2021-08-31 01:55:48,614 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:48,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:48,615 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) [2021-08-31 01:55:48,616 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 [2021-08-31 01:55:48,624 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 01:55:48,624 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:55:49,141 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 01:55:49,148 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 [2021-08-31 01:55:49,149 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:55:49,149 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:55:49,149 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:55:49,149 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:55:49,149 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 01:55:49,149 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:49,149 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:55:49,149 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:55:49,149 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration27_Loop [2021-08-31 01:55:49,149 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:55:49,149 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:55:49,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:55:49,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:55:49,553 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:55:49,556 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 01:55:49,557 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:49,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:49,561 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) [2021-08-31 01:55:49,562 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 [2021-08-31 01:55:49,563 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 [2021-08-31 01:55:49,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:49,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:49,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:49,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:49,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:55:49,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:55:49,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:49,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:49,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-31 01:55:49,609 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:49,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:49,610 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) [2021-08-31 01:55:49,624 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 [2021-08-31 01:55:49,624 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 [2021-08-31 01:55:49,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:49,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:49,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:49,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:49,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:55:49,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:55:49,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:49,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:49,685 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 [2021-08-31 01:55:49,685 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-08-31 01:55:49,685 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:49,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:49,687 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) [2021-08-31 01:55:49,693 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 [2021-08-31 01:55:49,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:49,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:49,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:49,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:49,701 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:55:49,703 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:55:49,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:49,701 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 [2021-08-31 01:55:49,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:49,752 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 [2021-08-31 01:55:49,752 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:49,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:49,754 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) [2021-08-31 01:55:49,756 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 [2021-08-31 01:55:49,757 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 [2021-08-31 01:55:49,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:49,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:49,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:49,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:49,765 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:55:49,770 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:55:49,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:49,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:49,816 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 [2021-08-31 01:55:49,816 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-08-31 01:55:49,817 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:49,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:49,821 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) [2021-08-31 01:55:49,822 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 [2021-08-31 01:55:49,824 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 [2021-08-31 01:55:49,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:49,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:49,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:49,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:49,832 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:55:49,835 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:55:49,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:49,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:49,880 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 [2021-08-31 01:55:49,881 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:49,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:49,882 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) [2021-08-31 01:55:49,891 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 [2021-08-31 01:55:49,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:49,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:49,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:49,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:49,899 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:55:49,907 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:55:49,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:49,913 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 [2021-08-31 01:55:49,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:49,951 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 [2021-08-31 01:55:49,951 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-08-31 01:55:49,951 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:49,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:49,952 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) [2021-08-31 01:55:49,954 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 [2021-08-31 01:55:49,955 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 [2021-08-31 01:55:49,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:49,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:49,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:49,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:49,963 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:55:49,965 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:55:49,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:49,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:50,013 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 [2021-08-31 01:55:50,014 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:50,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:50,017 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) [2021-08-31 01:55:50,018 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 [2021-08-31 01:55:50,019 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 [2021-08-31 01:55:50,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:50,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:50,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:50,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:50,027 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:55:50,034 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:55:50,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:50,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:50,081 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 [2021-08-31 01:55:50,082 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-08-31 01:55:50,082 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:50,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:50,085 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) [2021-08-31 01:55:50,087 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 [2021-08-31 01:55:50,089 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 [2021-08-31 01:55:50,096 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:50,096 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:55:50,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:50,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:50,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:50,096 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:55:50,099 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:55:50,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:50,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:50,154 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 [2021-08-31 01:55:50,155 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:50,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:50,157 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) [2021-08-31 01:55:50,158 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 [2021-08-31 01:55:50,159 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 [2021-08-31 01:55:50,167 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:50,167 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:55:50,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:50,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:50,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:50,167 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:55:50,172 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:55:50,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:50,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:50,216 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 [2021-08-31 01:55:50,216 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-08-31 01:55:50,217 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:50,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:50,221 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) [2021-08-31 01:55:50,222 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 [2021-08-31 01:55:50,224 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 [2021-08-31 01:55:50,232 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:50,232 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-31 01:55:50,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:50,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:50,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:50,232 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:55:50,235 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:55:50,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:50,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:50,280 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 [2021-08-31 01:55:50,280 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:50,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:50,281 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) [2021-08-31 01:55:50,289 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 [2021-08-31 01:55:50,289 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 [2021-08-31 01:55:50,297 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:50,297 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-31 01:55:50,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:50,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:50,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:50,297 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:55:50,314 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:55:50,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:50,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:50,357 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 [2021-08-31 01:55:50,357 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-08-31 01:55:50,358 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:50,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:50,361 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) [2021-08-31 01:55:50,362 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 [2021-08-31 01:55:50,364 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 [2021-08-31 01:55:50,372 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:50,373 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:55:50,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:50,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:50,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:50,373 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:55:50,378 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:55:50,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:50,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:50,420 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 [2021-08-31 01:55:50,420 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:50,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:50,422 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) [2021-08-31 01:55:50,422 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 [2021-08-31 01:55:50,425 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 [2021-08-31 01:55:50,431 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:50,432 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:55:50,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:50,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:50,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:50,432 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:55:50,439 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:55:50,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:50,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:50,489 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 [2021-08-31 01:55:50,489 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-08-31 01:55:50,489 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:50,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:50,490 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) [2021-08-31 01:55:50,498 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 [2021-08-31 01:55:50,499 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 [2021-08-31 01:55:50,506 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:50,506 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:55:50,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:50,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:50,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:50,506 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:55:50,509 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:55:50,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:50,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:50,532 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 [2021-08-31 01:55:50,533 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:50,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:50,533 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) [2021-08-31 01:55:50,534 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 [2021-08-31 01:55:50,535 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 [2021-08-31 01:55:50,542 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:50,542 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:55:50,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:50,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:50,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:50,542 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:55:50,547 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:55:50,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:50,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:50,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-08-31 01:55:50,597 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-08-31 01:55:50,597 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:50,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:50,598 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) [2021-08-31 01:55:50,599 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 [2021-08-31 01:55:50,600 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 [2021-08-31 01:55:50,608 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:50,608 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:55:50,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:50,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:50,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:50,608 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-31 01:55:50,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:55:50,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:50,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:50,648 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 [2021-08-31 01:55:50,649 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:50,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:50,649 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) [2021-08-31 01:55:50,650 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 [2021-08-31 01:55:50,651 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 [2021-08-31 01:55:50,658 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:50,658 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:55:50,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:50,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:50,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:50,658 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-31 01:55:50,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:55:50,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:50,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:50,721 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 [2021-08-31 01:55:50,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:55:50,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-31 01:55:50,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-08-31 01:55:50,722 INFO L87 Difference]: Start difference. First operand 425 states and 471 transitions. cyclomatic complexity: 50 Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:55:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:55:52,132 INFO L93 Difference]: Finished difference Result 704 states and 754 transitions. [2021-08-31 01:55:52,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-31 01:55:52,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 704 states and 754 transitions. [2021-08-31 01:55:52,134 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 139 [2021-08-31 01:55:52,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 704 states to 654 states and 704 transitions. [2021-08-31 01:55:52,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 654 [2021-08-31 01:55:52,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 654 [2021-08-31 01:55:52,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 654 states and 704 transitions. [2021-08-31 01:55:52,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:55:52,137 INFO L681 BuchiCegarLoop]: Abstraction has 654 states and 704 transitions. [2021-08-31 01:55:52,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states and 704 transitions. [2021-08-31 01:55:52,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 447. [2021-08-31 01:55:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 447 states have (on average 1.087248322147651) internal successors, (486), 446 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:55:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 486 transitions. [2021-08-31 01:55:52,146 INFO L704 BuchiCegarLoop]: Abstraction has 447 states and 486 transitions. [2021-08-31 01:55:52,146 INFO L587 BuchiCegarLoop]: Abstraction has 447 states and 486 transitions. [2021-08-31 01:55:52,146 INFO L425 BuchiCegarLoop]: ======== Iteration 28============ [2021-08-31 01:55:52,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 447 states and 486 transitions. [2021-08-31 01:55:52,148 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 65 [2021-08-31 01:55:52,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:55:52,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:55:52,149 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:55:52,149 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:55:52,149 INFO L791 eck$LassoCheckResult]: Stem: 22220#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 22214#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 22205#L51 assume !(0 == mp_add_~a3~0 % 256); 22206#L51-1 mp_add_~nb~0 := 4; 22207#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 22209#L63 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 22211#L65 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 22234#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 22404#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22403#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22402#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 22401#L76-2 assume !(1 == mp_add_~i~0 % 256); 22400#L77-1 assume !(2 == mp_add_~i~0 % 256); 22399#L78-1 assume !(3 == mp_add_~i~0 % 256); 22398#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22397#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 22396#L82-2 assume !(1 == mp_add_~i~0 % 256); 22395#L83-1 assume !(2 == mp_add_~i~0 % 256); 22394#L84-1 assume !(3 == mp_add_~i~0 % 256); 22392#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22393#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 22462#L91-1 assume !(1 == mp_add_~i~0 % 256); 22461#L92-1 assume !(2 == mp_add_~i~0 % 256); 22460#L93-1 assume !(3 == mp_add_~i~0 % 256); 22459#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22458#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22457#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22456#L76 assume !(0 == mp_add_~i~0 % 256); 22455#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 22454#L77-1 assume !(2 == mp_add_~i~0 % 256); 22453#L78-1 assume !(3 == mp_add_~i~0 % 256); 22452#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22450#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22451#L87-1 assume !(0 == mp_add_~i~0 % 256); 22513#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 22512#L92-1 assume !(2 == mp_add_~i~0 % 256); 22511#L93-1 assume !(3 == mp_add_~i~0 % 256); 22510#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22509#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22508#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22507#L76 assume !(0 == mp_add_~i~0 % 256); 22506#L76-2 assume !(1 == mp_add_~i~0 % 256); 22505#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 22503#L78-1 assume !(3 == mp_add_~i~0 % 256); 22498#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22499#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22572#L87-1 assume !(0 == mp_add_~i~0 % 256); 22571#L91-1 assume !(1 == mp_add_~i~0 % 256); 22570#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 22569#L93-1 assume !(3 == mp_add_~i~0 % 256); 22568#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22567#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22566#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22565#L76 assume !(0 == mp_add_~i~0 % 256); 22564#L76-2 assume !(1 == mp_add_~i~0 % 256); 22563#L77-1 assume !(2 == mp_add_~i~0 % 256); 22562#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 22561#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22560#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22472#L87-1 assume !(0 == mp_add_~i~0 % 256); 22467#L91-1 assume !(1 == mp_add_~i~0 % 256); 22468#L92-1 assume !(2 == mp_add_~i~0 % 256); 22463#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 22216#L94-1 [2021-08-31 01:55:52,149 INFO L793 eck$LassoCheckResult]: Loop: 22216#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22217#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22490#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22489#L76 assume !(0 == mp_add_~i~0 % 256); 22488#L76-2 assume !(1 == mp_add_~i~0 % 256); 22221#L77-1 assume !(2 == mp_add_~i~0 % 256); 22222#L78-1 assume !(3 == mp_add_~i~0 % 256); 22226#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22552#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22551#L87-1 assume !(0 == mp_add_~i~0 % 256); 22550#L91-1 assume !(1 == mp_add_~i~0 % 256); 22549#L92-1 assume !(2 == mp_add_~i~0 % 256); 22464#L93-1 assume !(3 == mp_add_~i~0 % 256); 22216#L94-1 [2021-08-31 01:55:52,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:55:52,150 INFO L82 PathProgramCache]: Analyzing trace with hash 775906304, now seen corresponding path program 1 times [2021-08-31 01:55:52,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:55:52,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702505007] [2021-08-31 01:55:52,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:55:52,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:55:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:55:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-31 01:55:52,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:55:52,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702505007] [2021-08-31 01:55:52,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702505007] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:55:52,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255767588] [2021-08-31 01:55:52,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:55:52,303 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:55:52,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:52,309 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:55:52,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-08-31 01:55:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:55:52,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-31 01:55:52,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:55:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-31 01:55:52,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:55:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-31 01:55:53,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255767588] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:55:53,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:55:53,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2021-08-31 01:55:53,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138403452] [2021-08-31 01:55:53,201 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:55:53,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:55:53,201 INFO L82 PathProgramCache]: Analyzing trace with hash 672830572, now seen corresponding path program 2 times [2021-08-31 01:55:53,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:55:53,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987594845] [2021-08-31 01:55:53,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:55:53,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:55:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:55:53,219 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:55:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:55:53,223 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:55:53,418 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:55:53,418 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:55:53,418 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:55:53,418 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:55:53,418 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 01:55:53,418 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:53,418 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:55:53,418 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:55:53,418 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration28_Loop [2021-08-31 01:55:53,419 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:55:53,419 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:55:53,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:55:53,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:55:53,788 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:55:53,788 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 01:55:53,788 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:53,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:53,792 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) [2021-08-31 01:55:53,792 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 [2021-08-31 01:55:53,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:55:53,793 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:55:53,850 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 [2021-08-31 01:55:53,851 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:53,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:53,852 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) [2021-08-31 01:55:53,852 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 [2021-08-31 01:55:53,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 01:55:53,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:55:54,371 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 01:55:54,375 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 [2021-08-31 01:55:54,376 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:55:54,376 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:55:54,376 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:55:54,376 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:55:54,376 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 01:55:54,376 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:54,376 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:55:54,376 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:55:54,376 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration28_Loop [2021-08-31 01:55:54,376 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:55:54,376 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:55:54,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:55:54,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:55:54,704 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:55:54,705 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 01:55:54,705 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:54,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:54,706 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) [2021-08-31 01:55:54,707 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 [2021-08-31 01:55:54,708 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 [2021-08-31 01:55:54,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:54,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:54,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:54,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:54,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:55:54,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:55:54,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:54,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:54,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-08-31 01:55:54,733 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:54,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:54,734 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) [2021-08-31 01:55:54,735 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 [2021-08-31 01:55:54,736 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 [2021-08-31 01:55:54,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:54,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:54,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:54,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:54,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:55:54,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:55:54,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:54,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:54,773 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 [2021-08-31 01:55:54,773 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-08-31 01:55:54,773 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:54,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:54,774 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) [2021-08-31 01:55:54,775 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 [2021-08-31 01:55:54,776 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 [2021-08-31 01:55:54,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:54,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:54,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:54,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:54,782 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:55:54,785 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:55:54,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:54,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:54,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-08-31 01:55:54,806 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:54,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:54,807 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) [2021-08-31 01:55:54,807 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 [2021-08-31 01:55:54,809 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 [2021-08-31 01:55:54,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:54,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:54,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:54,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:54,815 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:55:54,818 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:55:54,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:54,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:54,838 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 [2021-08-31 01:55:54,838 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-08-31 01:55:54,838 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:54,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:54,839 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) [2021-08-31 01:55:54,840 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 [2021-08-31 01:55:54,841 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 [2021-08-31 01:55:54,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:54,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:54,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:54,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:54,847 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:55:54,849 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:55:54,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:54,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:54,901 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 [2021-08-31 01:55:54,901 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:54,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:54,902 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) [2021-08-31 01:55:54,903 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 [2021-08-31 01:55:54,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 [2021-08-31 01:55:54,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:54,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:54,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:54,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:54,911 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:55:54,914 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:55:54,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:54,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:54,935 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 [2021-08-31 01:55:54,935 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-08-31 01:55:54,935 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:54,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:54,936 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) [2021-08-31 01:55:54,937 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 [2021-08-31 01:55:54,938 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 [2021-08-31 01:55:54,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:54,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:54,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:54,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:54,944 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:55:54,946 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:55:54,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:54,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:54,965 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 [2021-08-31 01:55:54,965 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:54,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:54,966 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) [2021-08-31 01:55:54,967 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 [2021-08-31 01:55:54,968 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 [2021-08-31 01:55:54,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:54,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:54,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:54,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:54,975 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:55:54,980 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:55:54,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:54,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:55,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-08-31 01:55:55,005 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-08-31 01:55:55,005 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:55,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:55,007 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) [2021-08-31 01:55:55,008 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 [2021-08-31 01:55:55,009 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 [2021-08-31 01:55:55,015 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:55,015 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:55:55,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:55,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:55,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:55,015 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:55:55,017 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:55:55,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:55,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:55,036 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 [2021-08-31 01:55:55,037 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:55,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:55,038 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) [2021-08-31 01:55:55,039 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 [2021-08-31 01:55:55,040 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 [2021-08-31 01:55:55,046 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:55,046 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:55:55,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:55,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:55,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:55,046 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:55:55,049 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:55:55,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:55,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:55,112 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 [2021-08-31 01:55:55,113 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-08-31 01:55:55,113 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:55,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:55,114 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) [2021-08-31 01:55:55,130 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 [2021-08-31 01:55:55,137 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:55,137 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-31 01:55:55,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:55,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:55,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:55,138 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:55:55,141 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:55:55,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:55,147 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 [2021-08-31 01:55:55,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:55,171 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 [2021-08-31 01:55:55,172 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:55,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:55,173 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) [2021-08-31 01:55:55,173 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 [2021-08-31 01:55:55,175 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 [2021-08-31 01:55:55,181 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:55,182 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-31 01:55:55,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:55,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:55,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:55,190 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:55:55,195 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:55:55,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:55,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:55,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-08-31 01:55:55,224 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-08-31 01:55:55,224 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:55,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:55,225 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) [2021-08-31 01:55:55,226 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 [2021-08-31 01:55:55,227 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 [2021-08-31 01:55:55,234 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:55,234 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:55:55,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:55,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:55,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:55,234 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:55:55,247 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:55:55,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:55,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:55,273 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 [2021-08-31 01:55:55,273 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:55,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:55,274 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) [2021-08-31 01:55:55,275 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 [2021-08-31 01:55:55,276 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 [2021-08-31 01:55:55,283 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:55,283 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:55:55,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:55,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:55,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:55,284 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:55:55,291 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:55:55,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:55,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:55,339 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 [2021-08-31 01:55:55,340 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-08-31 01:55:55,340 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:55,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:55,341 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) [2021-08-31 01:55:55,347 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 [2021-08-31 01:55:55,355 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:55,355 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:55:55,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:55,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:55,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:55,355 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:55:55,357 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:55:55,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:55,362 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 [2021-08-31 01:55:55,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:55,405 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 [2021-08-31 01:55:55,405 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:55,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:55,409 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) [2021-08-31 01:55:55,413 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 [2021-08-31 01:55:55,413 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 [2021-08-31 01:55:55,420 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:55,420 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:55:55,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:55,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:55,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:55,420 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:55:55,425 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:55:55,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:55,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:55,459 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 [2021-08-31 01:55:55,460 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-08-31 01:55:55,460 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:55,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:55,461 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) [2021-08-31 01:55:55,469 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 [2021-08-31 01:55:55,476 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:55,476 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:55:55,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:55,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:55,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:55,477 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-31 01:55:55,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:55:55,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:55,480 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 [2021-08-31 01:55:55,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:55,524 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 [2021-08-31 01:55:55,525 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:55,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:55,526 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) [2021-08-31 01:55:55,527 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 [2021-08-31 01:55:55,528 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 [2021-08-31 01:55:55,535 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:55:55,535 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:55:55,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:55,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:55,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:55,536 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-31 01:55:55,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:55:55,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:55,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:55,587 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 [2021-08-31 01:55:55,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:55:55,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-31 01:55:55,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-08-31 01:55:55,589 INFO L87 Difference]: Start difference. First operand 447 states and 486 transitions. cyclomatic complexity: 43 Second operand has 14 states, 14 states have (on average 9.357142857142858) internal successors, (131), 14 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:55:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:55:57,174 INFO L93 Difference]: Finished difference Result 524 states and 558 transitions. [2021-08-31 01:55:57,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-31 01:55:57,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 524 states and 558 transitions. [2021-08-31 01:55:57,177 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 65 [2021-08-31 01:55:57,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 524 states to 524 states and 558 transitions. [2021-08-31 01:55:57,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 524 [2021-08-31 01:55:57,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 524 [2021-08-31 01:55:57,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 524 states and 558 transitions. [2021-08-31 01:55:57,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:55:57,180 INFO L681 BuchiCegarLoop]: Abstraction has 524 states and 558 transitions. [2021-08-31 01:55:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states and 558 transitions. [2021-08-31 01:55:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 356. [2021-08-31 01:55:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 356 states have (on average 1.0814606741573034) internal successors, (385), 355 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:55:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 385 transitions. [2021-08-31 01:55:57,187 INFO L704 BuchiCegarLoop]: Abstraction has 356 states and 385 transitions. [2021-08-31 01:55:57,187 INFO L587 BuchiCegarLoop]: Abstraction has 356 states and 385 transitions. [2021-08-31 01:55:57,187 INFO L425 BuchiCegarLoop]: ======== Iteration 29============ [2021-08-31 01:55:57,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 356 states and 385 transitions. [2021-08-31 01:55:57,188 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 65 [2021-08-31 01:55:57,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:55:57,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:55:57,189 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:55:57,189 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:55:57,189 INFO L791 eck$LassoCheckResult]: Stem: 23597#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 23592#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 23583#L51 assume !(0 == mp_add_~a3~0 % 256); 23584#L51-1 mp_add_~nb~0 := 4; 23585#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 23587#L63 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 23589#L65 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 23615#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 23743#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23742#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23741#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 23740#L76-2 assume !(1 == mp_add_~i~0 % 256); 23739#L77-1 assume !(2 == mp_add_~i~0 % 256); 23738#L78-1 assume !(3 == mp_add_~i~0 % 256); 23737#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 23736#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 23735#L82-2 assume !(1 == mp_add_~i~0 % 256); 23734#L83-1 assume !(2 == mp_add_~i~0 % 256); 23733#L84-1 assume !(3 == mp_add_~i~0 % 256); 23732#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23731#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 23730#L91-1 assume !(1 == mp_add_~i~0 % 256); 23729#L92-1 assume !(2 == mp_add_~i~0 % 256); 23728#L93-1 assume !(3 == mp_add_~i~0 % 256); 23727#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23726#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23725#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23724#L76 assume !(0 == mp_add_~i~0 % 256); 23723#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 23722#L77-1 assume !(2 == mp_add_~i~0 % 256); 23721#L78-1 assume !(3 == mp_add_~i~0 % 256); 23719#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 23718#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23717#L87-1 assume !(0 == mp_add_~i~0 % 256); 23716#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 23713#L92-1 assume !(2 == mp_add_~i~0 % 256); 23710#L93-1 assume !(3 == mp_add_~i~0 % 256); 23707#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23704#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23703#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23702#L76 assume !(0 == mp_add_~i~0 % 256); 23701#L76-2 assume !(1 == mp_add_~i~0 % 256); 23698#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 23603#L78-1 assume !(3 == mp_add_~i~0 % 256); 23604#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 23801#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23841#L87-1 assume !(0 == mp_add_~i~0 % 256); 23840#L91-1 assume !(1 == mp_add_~i~0 % 256); 23839#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 23833#L93-1 assume !(3 == mp_add_~i~0 % 256); 23822#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23823#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23711#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23712#L76 assume !(0 == mp_add_~i~0 % 256); 23705#L76-2 assume !(1 == mp_add_~i~0 % 256); 23706#L77-1 assume !(2 == mp_add_~i~0 % 256); 23832#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 23831#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 23830#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23829#L87-1 assume !(0 == mp_add_~i~0 % 256); 23828#L91-1 assume !(1 == mp_add_~i~0 % 256); 23827#L92-1 assume !(2 == mp_add_~i~0 % 256); 23824#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 23825#L94-1 [2021-08-31 01:55:57,189 INFO L793 eck$LassoCheckResult]: Loop: 23825#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23714#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23715#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23708#L76 assume !(0 == mp_add_~i~0 % 256); 23709#L76-2 assume !(1 == mp_add_~i~0 % 256); 23699#L77-1 assume !(2 == mp_add_~i~0 % 256); 23700#L78-1 assume !(3 == mp_add_~i~0 % 256); 23838#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 23837#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23836#L87-1 assume !(0 == mp_add_~i~0 % 256); 23835#L91-1 assume !(1 == mp_add_~i~0 % 256); 23834#L92-1 assume !(2 == mp_add_~i~0 % 256); 23826#L93-1 assume !(3 == mp_add_~i~0 % 256); 23825#L94-1 [2021-08-31 01:55:57,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:55:57,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1728940926, now seen corresponding path program 1 times [2021-08-31 01:55:57,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:55:57,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156025229] [2021-08-31 01:55:57,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:55:57,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:55:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:55:57,206 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:55:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:55:57,227 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:55:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:55:57,228 INFO L82 PathProgramCache]: Analyzing trace with hash 672830572, now seen corresponding path program 3 times [2021-08-31 01:55:57,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:55:57,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433541001] [2021-08-31 01:55:57,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:55:57,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:55:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:55:57,232 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:55:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:55:57,234 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:55:57,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:55:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash 334650383, now seen corresponding path program 2 times [2021-08-31 01:55:57,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:55:57,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128591362] [2021-08-31 01:55:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:55:57,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:55:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:55:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 40 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:55:57,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:55:57,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128591362] [2021-08-31 01:55:57,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128591362] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:55:57,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781936299] [2021-08-31 01:55:57,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-31 01:55:57,473 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:55:57,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:57,474 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:55:57,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-08-31 01:55:57,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-31 01:55:57,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 01:55:57,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-31 01:55:57,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:55:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-31 01:55:58,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:55:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-31 01:55:58,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781936299] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:55:58,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:55:58,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2021-08-31 01:55:58,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023123469] [2021-08-31 01:55:58,746 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:55:58,746 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:55:58,746 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:55:58,746 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:55:58,746 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 01:55:58,746 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:58,746 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:55:58,746 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:55:58,746 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration29_Loop [2021-08-31 01:55:58,746 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:55:58,746 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:55:58,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:55:58,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:55:59,002 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:55:59,002 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 01:55:59,002 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:59,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:59,003 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) [2021-08-31 01:55:59,004 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 [2021-08-31 01:55:59,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:55:59,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:55:59,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-08-31 01:55:59,053 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:59,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:59,054 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) [2021-08-31 01:55:59,055 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 [2021-08-31 01:55:59,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 01:55:59,056 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:55:59,606 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 01:55:59,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-08-31 01:55:59,611 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:55:59,611 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:55:59,611 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:55:59,611 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:55:59,611 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 01:55:59,611 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:59,611 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:55:59,611 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:55:59,611 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration29_Loop [2021-08-31 01:55:59,611 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:55:59,612 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:55:59,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:55:59,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:55:59,922 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:55:59,923 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 01:55:59,923 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:59,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:59,924 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) [2021-08-31 01:55:59,924 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 [2021-08-31 01:55:59,926 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 [2021-08-31 01:55:59,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:59,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:59,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:59,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:59,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:55:59,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:55:59,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:59,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:55:59,978 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 [2021-08-31 01:55:59,978 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:55:59,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:55:59,979 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) [2021-08-31 01:55:59,979 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 [2021-08-31 01:55:59,981 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 [2021-08-31 01:55:59,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:55:59,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:55:59,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:55:59,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:55:59,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:55:59,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:55:59,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:55:59,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,008 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 [2021-08-31 01:56:00,008 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-08-31 01:56:00,009 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,009 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) [2021-08-31 01:56:00,010 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 [2021-08-31 01:56:00,011 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 [2021-08-31 01:56:00,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:00,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,018 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:00,020 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:00,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,037 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 [2021-08-31 01:56:00,037 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,038 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) [2021-08-31 01:56:00,038 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 [2021-08-31 01:56:00,040 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 [2021-08-31 01:56:00,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:00,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,047 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:00,049 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:00,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-08-31 01:56:00,069 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-08-31 01:56:00,069 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,070 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) [2021-08-31 01:56:00,070 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 [2021-08-31 01:56:00,072 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 [2021-08-31 01:56:00,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:00,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,079 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:00,081 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:00,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,099 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 [2021-08-31 01:56:00,099 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,100 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:00,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-08-31 01:56:00,101 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 [2021-08-31 01:56:00,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:00,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,109 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:00,115 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:00,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-08-31 01:56:00,136 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-08-31 01:56:00,136 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,137 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:00,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-08-31 01:56:00,139 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 [2021-08-31 01:56:00,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:00,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,146 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:00,155 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:00,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-08-31 01:56:00,174 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,175 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:00,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-08-31 01:56:00,176 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 [2021-08-31 01:56:00,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:00,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,184 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:00,189 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:00,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2021-08-31 01:56:00,211 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-08-31 01:56:00,211 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,212 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:00,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-08-31 01:56:00,214 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 [2021-08-31 01:56:00,220 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:00,221 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:00,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,221 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:00,222 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:00,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:00,242 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,242 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:00,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-08-31 01:56:00,244 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 [2021-08-31 01:56:00,251 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:00,251 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:00,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,252 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:00,255 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:00,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2021-08-31 01:56:00,297 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-08-31 01:56:00,297 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,298 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:00,310 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 [2021-08-31 01:56:00,318 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:00,318 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-31 01:56:00,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,319 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:00,321 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:00,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-08-31 01:56:00,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:00,367 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,369 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:00,379 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 [2021-08-31 01:56:00,387 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:00,387 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-31 01:56:00,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,388 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:00,394 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:00,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-08-31 01:56:00,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:00,433 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-08-31 01:56:00,434 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,437 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:00,440 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 [2021-08-31 01:56:00,449 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:00,449 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:00,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,450 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:00,453 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:00,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-08-31 01:56:00,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:00,499 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,500 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:00,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-08-31 01:56:00,503 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 [2021-08-31 01:56:00,511 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:00,511 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:00,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,512 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:00,518 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:00,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:00,568 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-08-31 01:56:00,568 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,573 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:00,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-08-31 01:56:00,576 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 [2021-08-31 01:56:00,584 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:00,585 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:00,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,585 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:00,587 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:00,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:00,626 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,627 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:00,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-08-31 01:56:00,628 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 [2021-08-31 01:56:00,635 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:00,635 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:00,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,635 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:00,644 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:00,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:00,665 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-08-31 01:56:00,665 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,666 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:00,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-08-31 01:56:00,667 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 [2021-08-31 01:56:00,674 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:00,674 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:00,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,675 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-31 01:56:00,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:56:00,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-08-31 01:56:00,699 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:00,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:00,700 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:00,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-08-31 01:56:00,702 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 [2021-08-31 01:56:00,709 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:00,710 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:00,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:00,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:00,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:00,710 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-31 01:56:00,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:56:00,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:00,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:00,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:00,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:56:00,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-31 01:56:00,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-31 01:56:00,739 INFO L87 Difference]: Start difference. First operand 356 states and 385 transitions. cyclomatic complexity: 33 Second operand has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:56:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:56:02,310 INFO L93 Difference]: Finished difference Result 359 states and 377 transitions. [2021-08-31 01:56:02,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-31 01:56:02,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 359 states and 377 transitions. [2021-08-31 01:56:02,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-31 01:56:02,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 359 states to 138 states and 144 transitions. [2021-08-31 01:56:02,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2021-08-31 01:56:02,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2021-08-31 01:56:02,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 144 transitions. [2021-08-31 01:56:02,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:56:02,314 INFO L681 BuchiCegarLoop]: Abstraction has 138 states and 144 transitions. [2021-08-31 01:56:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 144 transitions. [2021-08-31 01:56:02,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 96. [2021-08-31 01:56:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.0625) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:56:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2021-08-31 01:56:02,316 INFO L704 BuchiCegarLoop]: Abstraction has 96 states and 102 transitions. [2021-08-31 01:56:02,316 INFO L587 BuchiCegarLoop]: Abstraction has 96 states and 102 transitions. [2021-08-31 01:56:02,316 INFO L425 BuchiCegarLoop]: ======== Iteration 30============ [2021-08-31 01:56:02,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 102 transitions. [2021-08-31 01:56:02,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-31 01:56:02,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:56:02,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:56:02,317 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:56:02,317 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:56:02,317 INFO L791 eck$LassoCheckResult]: Stem: 24797#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 24792#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 24785#L51 assume !(0 == mp_add_~a3~0 % 256); 24786#L51-1 mp_add_~nb~0 := 4; 24787#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 24788#L63 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 24789#L65 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 24795#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 24796#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 24847#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24846#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 24845#L76-2 assume !(1 == mp_add_~i~0 % 256); 24844#L77-1 assume !(2 == mp_add_~i~0 % 256); 24843#L78-1 assume !(3 == mp_add_~i~0 % 256); 24842#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24841#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 24840#L82-2 assume !(1 == mp_add_~i~0 % 256); 24839#L83-1 assume !(2 == mp_add_~i~0 % 256); 24838#L84-1 assume !(3 == mp_add_~i~0 % 256); 24837#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24836#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 24835#L91-1 assume !(1 == mp_add_~i~0 % 256); 24834#L92-1 assume !(2 == mp_add_~i~0 % 256); 24833#L93-1 assume !(3 == mp_add_~i~0 % 256); 24832#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24831#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 24830#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24829#L76 assume !(0 == mp_add_~i~0 % 256); 24828#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 24827#L77-1 assume !(2 == mp_add_~i~0 % 256); 24826#L78-1 assume !(3 == mp_add_~i~0 % 256); 24825#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24824#L82 assume !(0 == mp_add_~i~0 % 256); 24823#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 24822#L83-1 assume !(2 == mp_add_~i~0 % 256); 24821#L84-1 assume !(3 == mp_add_~i~0 % 256); 24820#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24819#L87-1 assume !(0 == mp_add_~i~0 % 256); 24818#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 24817#L92-1 assume !(2 == mp_add_~i~0 % 256); 24816#L93-1 assume !(3 == mp_add_~i~0 % 256); 24815#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24814#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 24813#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24812#L76 assume !(0 == mp_add_~i~0 % 256); 24811#L76-2 assume !(1 == mp_add_~i~0 % 256); 24809#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 24810#L78-1 assume !(3 == mp_add_~i~0 % 256); 24860#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24859#L82 assume !(0 == mp_add_~i~0 % 256); 24858#L82-2 assume !(1 == mp_add_~i~0 % 256); 24857#L83-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 24856#L84-1 assume !(3 == mp_add_~i~0 % 256); 24855#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24854#L87-1 assume !(0 == mp_add_~i~0 % 256); 24853#L91-1 assume !(1 == mp_add_~i~0 % 256); 24852#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 24851#L93-1 assume !(3 == mp_add_~i~0 % 256); 24850#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24849#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 24848#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24808#L76 assume !(0 == mp_add_~i~0 % 256); 24798#L76-2 assume !(1 == mp_add_~i~0 % 256); 24799#L77-1 assume !(2 == mp_add_~i~0 % 256); 24800#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 24802#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24868#L82 assume !(0 == mp_add_~i~0 % 256); 24866#L82-2 assume !(1 == mp_add_~i~0 % 256); 24864#L83-1 assume !(2 == mp_add_~i~0 % 256); 24861#L84-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 24862#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24874#L87-1 assume !(0 == mp_add_~i~0 % 256); 24877#L91-1 assume !(1 == mp_add_~i~0 % 256); 24876#L92-1 assume !(2 == mp_add_~i~0 % 256); 24875#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 24794#L94-1 [2021-08-31 01:56:02,317 INFO L793 eck$LassoCheckResult]: Loop: 24794#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24790#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 24791#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 24806#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24803#L82 assume !(0 == mp_add_~i~0 % 256); 24804#L82-2 assume !(1 == mp_add_~i~0 % 256); 24807#L83-1 assume !(2 == mp_add_~i~0 % 256); 24805#L84-1 assume !(3 == mp_add_~i~0 % 256); 24801#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24793#L87-1 assume !(0 == mp_add_~i~0 % 256); 24782#L91-1 assume !(1 == mp_add_~i~0 % 256); 24783#L92-1 assume !(2 == mp_add_~i~0 % 256); 24784#L93-1 assume !(3 == mp_add_~i~0 % 256); 24794#L94-1 [2021-08-31 01:56:02,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:56:02,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1634905966, now seen corresponding path program 1 times [2021-08-31 01:56:02,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:56:02,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215959658] [2021-08-31 01:56:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:56:02,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:56:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:56:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 27 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-31 01:56:02,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:56:02,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215959658] [2021-08-31 01:56:02,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215959658] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:56:02,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873072475] [2021-08-31 01:56:02,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:56:02,671 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:56:02,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:02,672 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:56:02,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2021-08-31 01:56:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:56:02,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-31 01:56:02,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:56:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-08-31 01:56:03,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 01:56:03,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873072475] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:56:03,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-31 01:56:03,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 15 [2021-08-31 01:56:03,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90781868] [2021-08-31 01:56:03,551 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:56:03,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:56:03,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 1 times [2021-08-31 01:56:03,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:56:03,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680843333] [2021-08-31 01:56:03,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:56:03,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:56:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:56:03,555 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:56:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:56:03,557 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:56:03,775 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:56:03,775 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:56:03,776 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:56:03,776 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:56:03,776 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 01:56:03,776 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:03,776 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:56:03,776 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:56:03,776 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration30_Loop [2021-08-31 01:56:03,776 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:56:03,776 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:56:03,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:56:03,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:56:04,145 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:56:04,145 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 01:56:04,145 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:04,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:04,147 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:04,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-08-31 01:56:04,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:56:04,150 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:56:04,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:04,229 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:04,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:04,232 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:04,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-08-31 01:56:04,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 01:56:04,235 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:56:04,786 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 01:56:04,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-08-31 01:56:04,790 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:56:04,791 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:56:04,791 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:56:04,791 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:56:04,791 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 01:56:04,791 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:04,791 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:56:04,791 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:56:04,791 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration30_Loop [2021-08-31 01:56:04,791 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:56:04,791 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:56:04,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:56:04,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:56:05,089 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:56:05,089 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 01:56:05,089 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,090 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-08-31 01:56:05,092 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 [2021-08-31 01:56:05,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:05,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:56:05,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:56:05,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2021-08-31 01:56:05,118 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,118 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-08-31 01:56:05,120 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 [2021-08-31 01:56:05,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:05,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:56:05,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:56:05,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2021-08-31 01:56:05,144 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-08-31 01:56:05,144 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,145 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-08-31 01:56:05,147 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 [2021-08-31 01:56:05,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:05,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,153 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:05,155 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:05,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2021-08-31 01:56:05,174 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,174 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-08-31 01:56:05,177 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 [2021-08-31 01:56:05,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:05,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,184 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:05,186 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:05,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2021-08-31 01:56:05,203 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-08-31 01:56:05,203 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,204 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-08-31 01:56:05,206 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 [2021-08-31 01:56:05,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:05,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,212 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:05,216 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:05,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2021-08-31 01:56:05,266 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,267 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-08-31 01:56:05,268 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 [2021-08-31 01:56:05,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:05,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,274 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:05,276 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:05,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2021-08-31 01:56:05,294 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-08-31 01:56:05,294 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,295 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-08-31 01:56:05,296 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 [2021-08-31 01:56:05,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:05,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,303 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:05,307 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:05,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2021-08-31 01:56:05,334 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,335 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-08-31 01:56:05,337 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 [2021-08-31 01:56:05,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:05,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,343 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:05,345 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:05,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2021-08-31 01:56:05,363 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-08-31 01:56:05,363 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,364 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-08-31 01:56:05,366 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 [2021-08-31 01:56:05,372 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:05,372 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:05,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,372 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:05,375 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:05,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2021-08-31 01:56:05,395 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,396 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-08-31 01:56:05,397 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 [2021-08-31 01:56:05,403 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:05,403 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:05,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,404 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:05,405 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:05,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2021-08-31 01:56:05,423 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-08-31 01:56:05,423 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,424 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-08-31 01:56:05,426 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 [2021-08-31 01:56:05,432 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:05,432 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-31 01:56:05,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,432 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:05,436 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:05,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2021-08-31 01:56:05,460 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,461 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-08-31 01:56:05,463 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 [2021-08-31 01:56:05,469 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:05,469 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-31 01:56:05,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,469 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:05,471 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:05,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2021-08-31 01:56:05,493 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-08-31 01:56:05,493 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,494 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-08-31 01:56:05,496 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 [2021-08-31 01:56:05,502 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:05,502 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:05,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,502 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:05,510 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:05,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2021-08-31 01:56:05,540 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,540 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-08-31 01:56:05,542 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 [2021-08-31 01:56:05,548 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:05,549 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:05,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,549 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:05,551 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:05,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2021-08-31 01:56:05,586 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-08-31 01:56:05,586 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,587 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2021-08-31 01:56:05,589 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 [2021-08-31 01:56:05,595 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:05,595 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:05,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,595 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:05,598 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:05,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2021-08-31 01:56:05,622 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,623 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2021-08-31 01:56:05,625 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 [2021-08-31 01:56:05,631 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:05,631 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:05,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,631 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:05,633 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:05,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2021-08-31 01:56:05,652 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-08-31 01:56:05,652 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,653 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2021-08-31 01:56:05,655 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 [2021-08-31 01:56:05,661 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:05,661 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:05,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,661 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-31 01:56:05,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:56:05,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:05,689 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:05,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:05,691 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:05,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2021-08-31 01:56:05,692 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 [2021-08-31 01:56:05,698 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:05,698 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:05,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:05,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:05,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:05,699 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-31 01:56:05,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:56:05,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:05,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:05,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2021-08-31 01:56:05,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:56:05,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 01:56:05,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-08-31 01:56:05,722 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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) [2021-08-31 01:56:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:56:06,052 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2021-08-31 01:56:06,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 01:56:06,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 163 transitions. [2021-08-31 01:56:06,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-31 01:56:06,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 96 states and 101 transitions. [2021-08-31 01:56:06,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2021-08-31 01:56:06,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2021-08-31 01:56:06,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 101 transitions. [2021-08-31 01:56:06,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:56:06,055 INFO L681 BuchiCegarLoop]: Abstraction has 96 states and 101 transitions. [2021-08-31 01:56:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 101 transitions. [2021-08-31 01:56:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-08-31 01:56:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:56:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2021-08-31 01:56:06,057 INFO L704 BuchiCegarLoop]: Abstraction has 96 states and 101 transitions. [2021-08-31 01:56:06,057 INFO L587 BuchiCegarLoop]: Abstraction has 96 states and 101 transitions. [2021-08-31 01:56:06,057 INFO L425 BuchiCegarLoop]: ======== Iteration 31============ [2021-08-31 01:56:06,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 101 transitions. [2021-08-31 01:56:06,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-31 01:56:06,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:56:06,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:56:06,058 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:56:06,058 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:56:06,059 INFO L791 eck$LassoCheckResult]: Stem: 25290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 25283#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 25276#L51 assume !(0 == mp_add_~a3~0 % 256); 25277#L51-1 mp_add_~nb~0 := 4; 25278#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 25279#L63 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 25280#L65 assume !(0 == mp_add_~b1~0 % 256); 25287#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 25288#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25342#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25340#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 25291#L76-2 assume !(1 == mp_add_~i~0 % 256); 25292#L77-1 assume !(2 == mp_add_~i~0 % 256); 25339#L78-1 assume !(3 == mp_add_~i~0 % 256); 25338#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25337#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 25336#L82-2 assume !(1 == mp_add_~i~0 % 256); 25335#L83-1 assume !(2 == mp_add_~i~0 % 256); 25334#L84-1 assume !(3 == mp_add_~i~0 % 256); 25333#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25332#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 25331#L91-1 assume !(1 == mp_add_~i~0 % 256); 25330#L92-1 assume !(2 == mp_add_~i~0 % 256); 25329#L93-1 assume !(3 == mp_add_~i~0 % 256); 25328#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25327#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25326#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25325#L76 assume !(0 == mp_add_~i~0 % 256); 25324#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 25323#L77-1 assume !(2 == mp_add_~i~0 % 256); 25322#L78-1 assume !(3 == mp_add_~i~0 % 256); 25321#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25320#L82 assume !(0 == mp_add_~i~0 % 256); 25319#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 25318#L83-1 assume !(2 == mp_add_~i~0 % 256); 25317#L84-1 assume !(3 == mp_add_~i~0 % 256); 25316#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25315#L87-1 assume !(0 == mp_add_~i~0 % 256); 25314#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 25313#L92-1 assume !(2 == mp_add_~i~0 % 256); 25312#L93-1 assume !(3 == mp_add_~i~0 % 256); 25311#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25310#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25309#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25308#L76 assume !(0 == mp_add_~i~0 % 256); 25307#L76-2 assume !(1 == mp_add_~i~0 % 256); 25305#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 25306#L78-1 assume !(3 == mp_add_~i~0 % 256); 25354#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25353#L82 assume !(0 == mp_add_~i~0 % 256); 25352#L82-2 assume !(1 == mp_add_~i~0 % 256); 25351#L83-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 25350#L84-1 assume !(3 == mp_add_~i~0 % 256); 25349#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25348#L87-1 assume !(0 == mp_add_~i~0 % 256); 25347#L91-1 assume !(1 == mp_add_~i~0 % 256); 25346#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 25345#L93-1 assume !(3 == mp_add_~i~0 % 256); 25344#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25343#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25341#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25303#L76 assume !(0 == mp_add_~i~0 % 256); 25304#L76-2 assume !(1 == mp_add_~i~0 % 256); 25293#L77-1 assume !(2 == mp_add_~i~0 % 256); 25294#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 25296#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25297#L82 assume !(0 == mp_add_~i~0 % 256); 25298#L82-2 assume !(1 == mp_add_~i~0 % 256); 25302#L83-1 assume !(2 == mp_add_~i~0 % 256); 25299#L84-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 25300#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25358#L87-1 assume !(0 == mp_add_~i~0 % 256); 25357#L91-1 assume !(1 == mp_add_~i~0 % 256); 25356#L92-1 assume !(2 == mp_add_~i~0 % 256); 25355#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 25289#L94-1 [2021-08-31 01:56:06,059 INFO L793 eck$LassoCheckResult]: Loop: 25289#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25281#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25282#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25301#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25362#L82 assume !(0 == mp_add_~i~0 % 256); 25365#L82-2 assume !(1 == mp_add_~i~0 % 256); 25363#L83-1 assume !(2 == mp_add_~i~0 % 256); 25360#L84-1 assume !(3 == mp_add_~i~0 % 256); 25295#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25284#L87-1 assume !(0 == mp_add_~i~0 % 256); 25273#L91-1 assume !(1 == mp_add_~i~0 % 256); 25274#L92-1 assume !(2 == mp_add_~i~0 % 256); 25275#L93-1 assume !(3 == mp_add_~i~0 % 256); 25289#L94-1 [2021-08-31 01:56:06,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:56:06,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2127532140, now seen corresponding path program 1 times [2021-08-31 01:56:06,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:56:06,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148772920] [2021-08-31 01:56:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:56:06,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:56:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:56:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 55 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-31 01:56:06,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:56:06,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148772920] [2021-08-31 01:56:06,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148772920] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:56:06,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904476744] [2021-08-31 01:56:06,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:56:06,339 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:56:06,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:06,340 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:56:06,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2021-08-31 01:56:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:56:06,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-31 01:56:06,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:56:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-08-31 01:56:08,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 01:56:08,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904476744] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:56:08,559 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-31 01:56:08,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2021-08-31 01:56:08,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802884405] [2021-08-31 01:56:08,560 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:56:08,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:56:08,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 2 times [2021-08-31 01:56:08,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:56:08,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226737515] [2021-08-31 01:56:08,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:56:08,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:56:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:56:08,564 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:56:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:56:08,567 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:56:08,769 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:56:08,769 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:56:08,769 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:56:08,769 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:56:08,769 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 01:56:08,769 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:08,769 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:56:08,769 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:56:08,769 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration31_Loop [2021-08-31 01:56:08,769 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:56:08,769 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:56:08,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:56:08,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:56:09,065 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:56:09,066 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 01:56:09,066 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:09,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:09,068 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:09,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2021-08-31 01:56:09,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:56:09,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:56:09,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:09,123 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:09,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:09,124 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:09,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2021-08-31 01:56:09,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 01:56:09,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:56:09,580 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 01:56:09,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2021-08-31 01:56:09,584 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:56:09,584 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:56:09,584 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:56:09,584 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:56:09,584 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 01:56:09,584 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:09,584 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:56:09,584 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:56:09,585 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration31_Loop [2021-08-31 01:56:09,585 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:56:09,585 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:56:09,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:56:09,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:56:09,912 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:56:09,912 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 01:56:09,913 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:09,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:09,913 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:09,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2021-08-31 01:56:09,916 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 [2021-08-31 01:56:09,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:09,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:09,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:09,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:09,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:56:09,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:56:09,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:09,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:09,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2021-08-31 01:56:09,941 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:09,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:09,942 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:09,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2021-08-31 01:56:09,944 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 [2021-08-31 01:56:09,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:09,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:09,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:09,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:09,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:56:09,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:56:09,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:09,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:09,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2021-08-31 01:56:09,968 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-08-31 01:56:09,968 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:09,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:09,969 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:09,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2021-08-31 01:56:09,971 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 [2021-08-31 01:56:09,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:09,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:09,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:09,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:09,977 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:09,979 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:09,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:09,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:09,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2021-08-31 01:56:09,999 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:09,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:09,999 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2021-08-31 01:56:10,002 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 [2021-08-31 01:56:10,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:10,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,008 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:10,009 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:10,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2021-08-31 01:56:10,027 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-08-31 01:56:10,027 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,028 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2021-08-31 01:56:10,030 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 [2021-08-31 01:56:10,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:10,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,036 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:10,042 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:10,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2021-08-31 01:56:10,067 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,067 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2021-08-31 01:56:10,069 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 [2021-08-31 01:56:10,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:10,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,076 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:10,079 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:10,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,082 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2021-08-31 01:56:10,097 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-08-31 01:56:10,097 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,098 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2021-08-31 01:56:10,100 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 [2021-08-31 01:56:10,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:10,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,107 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:10,110 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:10,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2021-08-31 01:56:10,131 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,131 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2021-08-31 01:56:10,133 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 [2021-08-31 01:56:10,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:10,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,139 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:10,141 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:10,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:10,160 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-08-31 01:56:10,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,162 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2021-08-31 01:56:10,170 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 [2021-08-31 01:56:10,176 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:10,176 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:10,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,176 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:10,179 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:10,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:10,199 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,200 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2021-08-31 01:56:10,202 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 [2021-08-31 01:56:10,208 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:10,208 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:10,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,208 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:10,209 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:10,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2021-08-31 01:56:10,228 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-08-31 01:56:10,228 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,228 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2021-08-31 01:56:10,230 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 [2021-08-31 01:56:10,236 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:10,236 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-31 01:56:10,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,237 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:10,240 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:10,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2021-08-31 01:56:10,264 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,264 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2021-08-31 01:56:10,266 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 [2021-08-31 01:56:10,272 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:10,272 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-31 01:56:10,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,273 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:10,274 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:10,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2021-08-31 01:56:10,294 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-08-31 01:56:10,294 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,295 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2021-08-31 01:56:10,297 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 [2021-08-31 01:56:10,303 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:10,303 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:10,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,304 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:10,311 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:10,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:10,339 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,340 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2021-08-31 01:56:10,342 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 [2021-08-31 01:56:10,348 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:10,348 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:10,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,348 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:10,351 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:10,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2021-08-31 01:56:10,373 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-08-31 01:56:10,373 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,374 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2021-08-31 01:56:10,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 [2021-08-31 01:56:10,382 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:10,383 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:10,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,383 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:10,386 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:10,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:10,406 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,407 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2021-08-31 01:56:10,409 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 [2021-08-31 01:56:10,415 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:10,415 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:10,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,415 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:10,417 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:10,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2021-08-31 01:56:10,435 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-08-31 01:56:10,436 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,436 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2021-08-31 01:56:10,438 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 [2021-08-31 01:56:10,444 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:10,444 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:10,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,445 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-31 01:56:10,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:56:10,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2021-08-31 01:56:10,473 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:10,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,474 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2021-08-31 01:56:10,476 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 [2021-08-31 01:56:10,482 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:10,483 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:10,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:10,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:10,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:10,483 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-31 01:56:10,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:56:10,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:10,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:10,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:10,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:56:10,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-31 01:56:10,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-08-31 01:56:10,506 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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) [2021-08-31 01:56:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:56:10,645 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2021-08-31 01:56:10,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 01:56:10,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 148 transitions. [2021-08-31 01:56:10,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-31 01:56:10,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 130 states and 136 transitions. [2021-08-31 01:56:10,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2021-08-31 01:56:10,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2021-08-31 01:56:10,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 136 transitions. [2021-08-31 01:56:10,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:56:10,647 INFO L681 BuchiCegarLoop]: Abstraction has 130 states and 136 transitions. [2021-08-31 01:56:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 136 transitions. [2021-08-31 01:56:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-08-31 01:56:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 129 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:56:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2021-08-31 01:56:10,649 INFO L704 BuchiCegarLoop]: Abstraction has 130 states and 136 transitions. [2021-08-31 01:56:10,649 INFO L587 BuchiCegarLoop]: Abstraction has 130 states and 136 transitions. [2021-08-31 01:56:10,649 INFO L425 BuchiCegarLoop]: ======== Iteration 32============ [2021-08-31 01:56:10,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 136 transitions. [2021-08-31 01:56:10,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-31 01:56:10,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:56:10,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:56:10,651 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:56:10,651 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:56:10,651 INFO L791 eck$LassoCheckResult]: Stem: 25764#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 25757#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 25749#L51 assume !(0 == mp_add_~a3~0 % 256); 25750#L51-1 mp_add_~nb~0 := 4; 25751#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 25752#L63 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 25753#L65 assume !(0 == mp_add_~b1~0 % 256); 25762#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 25763#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25821#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25818#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 25765#L76-2 assume !(1 == mp_add_~i~0 % 256); 25766#L77-1 assume !(2 == mp_add_~i~0 % 256); 25767#L78-1 assume !(3 == mp_add_~i~0 % 256); 25862#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25861#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 25860#L82-2 assume !(1 == mp_add_~i~0 % 256); 25859#L83-1 assume !(2 == mp_add_~i~0 % 256); 25858#L84-1 assume !(3 == mp_add_~i~0 % 256); 25857#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25855#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 25853#L91-1 assume !(1 == mp_add_~i~0 % 256); 25851#L92-1 assume !(2 == mp_add_~i~0 % 256); 25849#L93-1 assume !(3 == mp_add_~i~0 % 256); 25847#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25845#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25831#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25832#L76 assume !(0 == mp_add_~i~0 % 256); 25816#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 25817#L77-1 assume !(2 == mp_add_~i~0 % 256); 25812#L78-1 assume !(3 == mp_add_~i~0 % 256); 25813#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25808#L82 assume !(0 == mp_add_~i~0 % 256); 25809#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 25804#L83-1 assume !(2 == mp_add_~i~0 % 256); 25805#L84-1 assume !(3 == mp_add_~i~0 % 256); 25800#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25801#L87-1 assume !(0 == mp_add_~i~0 % 256); 25796#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 25797#L92-1 assume !(2 == mp_add_~i~0 % 256); 25792#L93-1 assume !(3 == mp_add_~i~0 % 256); 25793#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25788#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25789#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25784#L76 assume !(0 == mp_add_~i~0 % 256); 25785#L76-2 assume !(1 == mp_add_~i~0 % 256); 25780#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 25781#L78-1 assume !(3 == mp_add_~i~0 % 256); 25842#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25840#L82 assume !(0 == mp_add_~i~0 % 256); 25838#L82-2 assume !(1 == mp_add_~i~0 % 256); 25836#L83-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 25834#L84-1 assume !(3 == mp_add_~i~0 % 256); 25830#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25828#L87-1 assume !(0 == mp_add_~i~0 % 256); 25827#L91-1 assume !(1 == mp_add_~i~0 % 256); 25826#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 25825#L93-1 assume !(3 == mp_add_~i~0 % 256); 25824#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25823#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25822#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25819#L76 assume !(0 == mp_add_~i~0 % 256); 25820#L76-2 assume !(1 == mp_add_~i~0 % 256); 25863#L77-1 assume !(2 == mp_add_~i~0 % 256); 25769#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 25770#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25870#L82 assume !(0 == mp_add_~i~0 % 256); 25775#L82-2 assume !(1 == mp_add_~i~0 % 256); 25776#L83-1 assume !(2 == mp_add_~i~0 % 256); 25865#L84-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 25866#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25877#L87-1 assume !(0 == mp_add_~i~0 % 256); 25878#L91-1 assume !(1 == mp_add_~i~0 % 256); 25876#L92-1 assume !(2 == mp_add_~i~0 % 256); 25864#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 25761#L94-1 [2021-08-31 01:56:10,651 INFO L793 eck$LassoCheckResult]: Loop: 25761#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25758#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25759#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25774#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25771#L82 assume !(0 == mp_add_~i~0 % 256); 25772#L82-2 assume !(1 == mp_add_~i~0 % 256); 25779#L83-1 assume !(2 == mp_add_~i~0 % 256); 25773#L84-1 assume !(3 == mp_add_~i~0 % 256); 25768#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25760#L87-1 assume !(0 == mp_add_~i~0 % 256); 25754#L91-1 assume !(1 == mp_add_~i~0 % 256); 25755#L92-1 assume !(2 == mp_add_~i~0 % 256); 25756#L93-1 assume !(3 == mp_add_~i~0 % 256); 25761#L94-1 [2021-08-31 01:56:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:56:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2126760406, now seen corresponding path program 1 times [2021-08-31 01:56:10,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:56:10,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623007025] [2021-08-31 01:56:10,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:56:10,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:56:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:56:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 55 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-31 01:56:10,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:56:10,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623007025] [2021-08-31 01:56:10,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623007025] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:56:10,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639169795] [2021-08-31 01:56:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:56:10,917 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:56:10,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:10,919 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:56:10,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2021-08-31 01:56:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:56:11,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-31 01:56:11,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:56:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-08-31 01:56:12,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 01:56:12,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639169795] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:56:12,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-31 01:56:12,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2021-08-31 01:56:12,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813719448] [2021-08-31 01:56:12,399 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:56:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:56:12,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 3 times [2021-08-31 01:56:12,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:56:12,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627473076] [2021-08-31 01:56:12,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:56:12,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:56:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:56:12,403 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:56:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:56:12,406 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:56:12,564 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:56:12,565 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:56:12,565 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:56:12,565 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:56:12,565 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 01:56:12,565 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:12,565 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:56:12,565 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:56:12,565 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration32_Loop [2021-08-31 01:56:12,565 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:56:12,565 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:56:12,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:56:12,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:56:12,822 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:56:12,822 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 01:56:12,822 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:12,823 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:12,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2021-08-31 01:56:12,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:56:12,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:56:12,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2021-08-31 01:56:12,873 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:12,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:12,874 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:12,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2021-08-31 01:56:12,875 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 01:56:12,875 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:56:13,936 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 01:56:13,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:13,940 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:56:13,940 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:56:13,940 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:56:13,940 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:56:13,940 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 01:56:13,941 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:13,941 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:56:13,941 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:56:13,941 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration32_Loop [2021-08-31 01:56:13,941 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:56:13,941 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:56:13,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:56:13,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:56:14,237 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:56:14,237 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 01:56:14,237 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,238 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2021-08-31 01:56:14,240 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 [2021-08-31 01:56:14,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:14,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:56:14,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:56:14,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:14,266 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,266 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2021-08-31 01:56:14,269 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 [2021-08-31 01:56:14,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:14,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:56:14,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:56:14,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2021-08-31 01:56:14,292 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-08-31 01:56:14,292 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,293 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2021-08-31 01:56:14,295 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 [2021-08-31 01:56:14,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:14,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,301 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:14,303 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:14,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:14,322 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,323 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2021-08-31 01:56:14,325 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 [2021-08-31 01:56:14,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:14,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,330 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:14,332 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:14,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2021-08-31 01:56:14,349 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-08-31 01:56:14,349 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,350 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2021-08-31 01:56:14,351 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 [2021-08-31 01:56:14,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:14,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,357 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:14,360 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:14,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:14,380 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,380 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2021-08-31 01:56:14,382 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 [2021-08-31 01:56:14,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:14,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,388 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:14,389 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:14,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2021-08-31 01:56:14,407 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-08-31 01:56:14,407 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,408 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2021-08-31 01:56:14,410 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 [2021-08-31 01:56:14,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:14,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,418 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:14,422 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:14,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2021-08-31 01:56:14,442 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,443 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2021-08-31 01:56:14,446 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 [2021-08-31 01:56:14,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:56:14,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,452 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:14,454 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:14,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2021-08-31 01:56:14,472 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-08-31 01:56:14,472 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,473 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2021-08-31 01:56:14,476 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 [2021-08-31 01:56:14,481 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:14,482 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:14,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,482 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:14,484 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:14,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2021-08-31 01:56:14,505 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,506 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2021-08-31 01:56:14,508 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 [2021-08-31 01:56:14,514 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:14,514 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:14,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,515 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-31 01:56:14,516 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-31 01:56:14,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:14,538 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-08-31 01:56:14,538 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,539 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2021-08-31 01:56:14,541 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 [2021-08-31 01:56:14,547 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:14,547 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-31 01:56:14,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,547 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:14,551 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:14,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2021-08-31 01:56:14,575 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,576 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2021-08-31 01:56:14,577 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 [2021-08-31 01:56:14,583 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:14,583 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-31 01:56:14,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,583 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:14,585 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:14,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:14,605 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-08-31 01:56:14,605 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,606 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2021-08-31 01:56:14,608 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 [2021-08-31 01:56:14,614 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:14,614 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:14,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,614 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:14,619 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:14,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2021-08-31 01:56:14,647 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,648 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2021-08-31 01:56:14,655 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 [2021-08-31 01:56:14,661 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:14,661 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:14,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,661 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-31 01:56:14,664 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-31 01:56:14,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2021-08-31 01:56:14,685 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-08-31 01:56:14,685 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,686 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2021-08-31 01:56:14,688 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 [2021-08-31 01:56:14,694 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:14,694 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:14,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,694 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:14,697 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:14,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2021-08-31 01:56:14,718 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,719 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2021-08-31 01:56:14,721 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 [2021-08-31 01:56:14,726 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:14,726 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-31 01:56:14,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,727 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-31 01:56:14,728 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 01:56:14,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2021-08-31 01:56:14,747 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-08-31 01:56:14,748 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,748 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2021-08-31 01:56:14,750 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 [2021-08-31 01:56:14,756 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:14,756 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:14,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,756 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-31 01:56:14,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:56:14,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:14,787 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:56:14,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:56:14,791 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:56:14,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2021-08-31 01:56:14,792 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 [2021-08-31 01:56:14,798 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-31 01:56:14,799 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-31 01:56:14,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:56:14,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:56:14,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:56:14,799 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-31 01:56:14,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:56:14,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:56:14,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:56:14,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2021-08-31 01:56:14,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:56:14,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-31 01:56:14,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-08-31 01:56:14,822 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:56:15,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:56:15,107 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2021-08-31 01:56:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 01:56:15,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 103 transitions. [2021-08-31 01:56:15,108 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 01:56:15,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 0 states and 0 transitions. [2021-08-31 01:56:15,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-31 01:56:15,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-31 01:56:15,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-31 01:56:15,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:56:15,108 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 01:56:15,108 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 01:56:15,108 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 01:56:15,108 INFO L425 BuchiCegarLoop]: ======== Iteration 33============ [2021-08-31 01:56:15,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-31 01:56:15,109 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 01:56:15,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-31 01:56:15,111 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 01:56:15,114 INFO L158 Benchmark]: Toolchain (without parser) took 129371.55ms. Allocated memory was 54.5MB in the beginning and 161.5MB in the end (delta: 107.0MB). Free memory was 32.0MB in the beginning and 104.0MB in the end (delta: -71.9MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2021-08-31 01:56:15,114 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 54.5MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 01:56:15,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.44ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.9MB in the beginning and 49.8MB in the end (delta: -18.0MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2021-08-31 01:56:15,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.90ms. Allocated memory is still 67.1MB. Free memory was 49.8MB in the beginning and 47.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 01:56:15,115 INFO L158 Benchmark]: Boogie Preprocessor took 49.63ms. Allocated memory is still 67.1MB. Free memory was 47.9MB in the beginning and 46.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 01:56:15,115 INFO L158 Benchmark]: RCFGBuilder took 316.74ms. Allocated memory is still 67.1MB. Free memory was 46.5MB in the beginning and 36.2MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-31 01:56:15,116 INFO L158 Benchmark]: BuchiAutomizer took 128605.17ms. Allocated memory was 67.1MB in the beginning and 161.5MB in the end (delta: 94.4MB). Free memory was 36.0MB in the beginning and 104.0MB in the end (delta: -68.0MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2021-08-31 01:56:15,117 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 54.5MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.44ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.9MB in the beginning and 49.8MB in the end (delta: -18.0MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.90ms. Allocated memory is still 67.1MB. Free memory was 49.8MB in the beginning and 47.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.63ms. Allocated memory is still 67.1MB. Free memory was 47.9MB in the beginning and 46.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 316.74ms. Allocated memory is still 67.1MB. Free memory was 46.5MB in the beginning and 36.2MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 128605.17ms. Allocated memory was 67.1MB in the beginning and 161.5MB in the end (delta: 94.4MB). Free memory was 36.0MB in the beginning and 104.0MB in the end (delta: -68.0MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 32 terminating modules (32 trivial, 0 deterministic, 0 nondeterministic). 32 modules have a trivial ranking function, the largest among these consists of 14 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 01:56:15,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2021-08-31 01:56:15,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2021-08-31 01:56:15,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2021-08-31 01:56:15,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2021-08-31 01:56:15,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:16,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-08-31 01:56:16,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-08-31 01:56:16,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-08-31 01:56:16,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-08-31 01:56:16,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-08-31 01:56:17,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:17,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-08-31 01:56:17,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-08-31 01:56:17,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-08-31 01:56:17,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-31 01:56:18,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...