./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:26:16,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:26:16,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:26:16,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:26:16,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:26:16,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:26:16,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:26:16,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:26:16,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:26:16,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:26:16,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:26:16,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:26:16,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:26:16,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:26:16,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:26:16,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:26:16,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:26:16,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:26:16,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:26:16,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:26:16,846 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:26:16,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:26:16,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:26:16,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:26:16,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:26:16,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:26:16,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:26:16,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:26:16,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:26:16,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:26:16,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:26:16,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:26:16,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:26:16,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:26:16,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:26:16,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:26:16,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:26:16,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:26:16,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:26:16,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:26:16,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:26:16,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:26:16,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:26:16,895 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:26:16,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:26:16,896 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:26:16,897 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:26:16,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:26:16,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:26:16,898 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:26:16,899 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:26:16,899 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:26:16,900 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:26:16,900 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:26:16,900 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:26:16,900 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:26:16,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:26:16,901 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:26:16,901 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:26:16,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:26:16,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:26:16,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:26:16,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:26:16,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:26:16,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:26:16,902 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:26:16,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:26:16,902 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:26:16,903 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:26:16,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:26:16,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:26:16,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:26:16,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:26:16,904 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:26:16,905 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:26:16,905 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2022-07-13 03:26:17,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:26:17,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:26:17,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:26:17,160 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:26:17,163 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:26:17,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2022-07-13 03:26:17,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8787e3519/4d3b854ba495430bbd5038de085f0eab/FLAG22a623186 [2022-07-13 03:26:17,650 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:26:17,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2022-07-13 03:26:17,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8787e3519/4d3b854ba495430bbd5038de085f0eab/FLAG22a623186 [2022-07-13 03:26:18,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8787e3519/4d3b854ba495430bbd5038de085f0eab [2022-07-13 03:26:18,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:26:18,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:26:18,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:26:18,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:26:18,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:26:18,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:26:18" (1/1) ... [2022-07-13 03:26:18,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44171661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:18, skipping insertion in model container [2022-07-13 03:26:18,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:26:18" (1/1) ... [2022-07-13 03:26:18,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:26:18,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:26:18,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2022-07-13 03:26:18,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:26:18,329 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:26:18,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2022-07-13 03:26:18,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:26:18,374 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:26:18,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:18 WrapperNode [2022-07-13 03:26:18,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:26:18,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:26:18,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:26:18,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:26:18,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:18" (1/1) ... [2022-07-13 03:26:18,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:18" (1/1) ... [2022-07-13 03:26:18,441 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 145 [2022-07-13 03:26:18,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:26:18,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:26:18,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:26:18,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:26:18,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:18" (1/1) ... [2022-07-13 03:26:18,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:18" (1/1) ... [2022-07-13 03:26:18,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:18" (1/1) ... [2022-07-13 03:26:18,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:18" (1/1) ... [2022-07-13 03:26:18,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:18" (1/1) ... [2022-07-13 03:26:18,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:18" (1/1) ... [2022-07-13 03:26:18,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:18" (1/1) ... [2022-07-13 03:26:18,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:26:18,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:26:18,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:26:18,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:26:18,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:18" (1/1) ... [2022-07-13 03:26:18,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:18,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:18,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:18,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:26:18,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:26:18,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:26:18,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:26:18,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:26:18,654 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:26:18,656 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:26:19,182 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:26:19,190 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:26:19,190 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 03:26:19,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:26:19 BoogieIcfgContainer [2022-07-13 03:26:19,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:26:19,194 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:26:19,194 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:26:19,197 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:26:19,198 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:26:19,198 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:26:18" (1/3) ... [2022-07-13 03:26:19,199 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b27652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:26:19, skipping insertion in model container [2022-07-13 03:26:19,199 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:26:19,199 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:18" (2/3) ... [2022-07-13 03:26:19,200 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b27652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:26:19, skipping insertion in model container [2022-07-13 03:26:19,200 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:26:19,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:26:19" (3/3) ... [2022-07-13 03:26:19,202 INFO L354 chiAutomizerObserver]: Analyzing ICFG byte_add_1-1.i [2022-07-13 03:26:19,264 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:26:19,265 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:26:19,265 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:26:19,265 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:26:19,265 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:26:19,265 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:26:19,265 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:26:19,266 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:26:19,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:19,295 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-13 03:26:19,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:19,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:19,303 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:26:19,304 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:19,304 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:26:19,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:19,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-13 03:26:19,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:19,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:19,313 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:26:19,314 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:19,320 INFO L752 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 29#L59true assume !(0 == mp_add_~a3~0#1 % 256); 11#L59-1true mp_add_~nb~0#1 := 4; 12#L69true assume !(0 == mp_add_~b3~0#1 % 256); 48#L69-1true mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 14#L80-2true [2022-07-13 03:26:19,321 INFO L754 eck$LassoCheckResult]: Loop: 14#L80-2true assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 21#L83true assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 50#L83-1true assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6#L89true assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 28#L95-1true assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 37#L99-1true assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 8#L100-1true assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 15#L101-1true assume !(3 == mp_add_~i~0#1 % 256); 16#L102-1true mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14#L80-2true [2022-07-13 03:26:19,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2022-07-13 03:26:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:19,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554772046] [2022-07-13 03:26:19,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:19,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:19,443 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:19,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:19,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:19,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1026291578, now seen corresponding path program 1 times [2022-07-13 03:26:19,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:19,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782459960] [2022-07-13 03:26:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:19,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:19,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782459960] [2022-07-13 03:26:19,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782459960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:19,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:19,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:26:19,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445845493] [2022-07-13 03:26:19,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:19,581 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:19,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:19,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:26:19,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:26:19,608 INFO L87 Difference]: Start difference. First operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:19,776 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2022-07-13 03:26:19,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:26:19,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 114 transitions. [2022-07-13 03:26:19,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-07-13 03:26:19,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 66 states and 98 transitions. [2022-07-13 03:26:19,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2022-07-13 03:26:19,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-07-13 03:26:19,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 98 transitions. [2022-07-13 03:26:19,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:19,804 INFO L369 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2022-07-13 03:26:19,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 98 transitions. [2022-07-13 03:26:19,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-07-13 03:26:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.5) internal successors, (96), 63 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2022-07-13 03:26:19,835 INFO L392 hiAutomatonCegarLoop]: Abstraction has 64 states and 96 transitions. [2022-07-13 03:26:19,835 INFO L374 stractBuchiCegarLoop]: Abstraction has 64 states and 96 transitions. [2022-07-13 03:26:19,835 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:26:19,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 96 transitions. [2022-07-13 03:26:19,837 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-13 03:26:19,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:19,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:19,838 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:19,839 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:19,839 INFO L752 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 139#L59 assume !(0 == mp_add_~a3~0#1 % 256); 140#L59-1 mp_add_~nb~0#1 := 4; 159#L69 assume !(0 == mp_add_~b3~0#1 % 256); 149#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 165#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 166#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 194#L83-1 [2022-07-13 03:26:19,839 INFO L754 eck$LassoCheckResult]: Loop: 194#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 138#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 144#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 181#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 184#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 172#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 173#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 174#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 179#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 180#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 162#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 168#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 169#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 194#L83-1 [2022-07-13 03:26:19,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:19,840 INFO L85 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2022-07-13 03:26:19,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:19,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268826352] [2022-07-13 03:26:19,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:19,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:20,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:20,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268826352] [2022-07-13 03:26:20,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268826352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:20,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:20,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 03:26:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718474063] [2022-07-13 03:26:20,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:20,046 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:20,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 1 times [2022-07-13 03:26:20,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:20,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459259803] [2022-07-13 03:26:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:20,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:20,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459259803] [2022-07-13 03:26:20,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459259803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:20,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:20,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:26:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528368294] [2022-07-13 03:26:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:20,121 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:20,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 03:26:20,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 03:26:20,122 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. cyclomatic complexity: 34 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:20,596 INFO L93 Difference]: Finished difference Result 222 states and 310 transitions. [2022-07-13 03:26:20,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 03:26:20,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 310 transitions. [2022-07-13 03:26:20,602 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 147 [2022-07-13 03:26:20,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 310 transitions. [2022-07-13 03:26:20,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2022-07-13 03:26:20,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2022-07-13 03:26:20,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 310 transitions. [2022-07-13 03:26:20,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:20,607 INFO L369 hiAutomatonCegarLoop]: Abstraction has 222 states and 310 transitions. [2022-07-13 03:26:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 310 transitions. [2022-07-13 03:26:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 79. [2022-07-13 03:26:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 78 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2022-07-13 03:26:20,615 INFO L392 hiAutomatonCegarLoop]: Abstraction has 79 states and 114 transitions. [2022-07-13 03:26:20,615 INFO L374 stractBuchiCegarLoop]: Abstraction has 79 states and 114 transitions. [2022-07-13 03:26:20,616 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:26:20,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 114 transitions. [2022-07-13 03:26:20,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-13 03:26:20,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:20,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:20,618 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:20,618 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:20,618 INFO L752 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 458#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 442#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 444#L61 assume !(0 == mp_add_~a2~0#1 % 256); 445#L59-1 mp_add_~nb~0#1 := 4; 495#L69 assume !(0 == mp_add_~b3~0#1 % 256); 490#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 491#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 496#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 460#L83-1 [2022-07-13 03:26:20,619 INFO L754 eck$LassoCheckResult]: Loop: 460#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 447#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 449#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 466#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 455#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 456#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 477#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 480#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 489#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 512#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 469#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 474#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 459#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 460#L83-1 [2022-07-13 03:26:20,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:20,619 INFO L85 PathProgramCache]: Analyzing trace with hash -384676570, now seen corresponding path program 1 times [2022-07-13 03:26:20,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:20,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524190200] [2022-07-13 03:26:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:20,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:20,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:20,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524190200] [2022-07-13 03:26:20,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524190200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:20,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:20,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:26:20,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996356408] [2022-07-13 03:26:20,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:20,672 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:20,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 2 times [2022-07-13 03:26:20,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:20,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126754699] [2022-07-13 03:26:20,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:20,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:20,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:20,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126754699] [2022-07-13 03:26:20,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126754699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:20,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:20,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:26:20,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961729587] [2022-07-13 03:26:20,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:20,720 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:20,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:20,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:26:20,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:26:20,721 INFO L87 Difference]: Start difference. First operand 79 states and 114 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) [2022-07-13 03:26:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:20,725 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2022-07-13 03:26:20,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:26:20,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 95 transitions. [2022-07-13 03:26:20,727 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-13 03:26:20,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 95 transitions. [2022-07-13 03:26:20,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-07-13 03:26:20,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-13 03:26:20,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 95 transitions. [2022-07-13 03:26:20,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:20,729 INFO L369 hiAutomatonCegarLoop]: Abstraction has 68 states and 95 transitions. [2022-07-13 03:26:20,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 95 transitions. [2022-07-13 03:26:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-13 03:26:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 67 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2022-07-13 03:26:20,733 INFO L392 hiAutomatonCegarLoop]: Abstraction has 68 states and 95 transitions. [2022-07-13 03:26:20,733 INFO L374 stractBuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2022-07-13 03:26:20,733 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:26:20,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 95 transitions. [2022-07-13 03:26:20,734 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-13 03:26:20,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:20,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:20,735 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:20,735 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:20,736 INFO L752 eck$LassoCheckResult]: Stem: 624#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 610#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 597#L59 assume !(0 == mp_add_~a3~0#1 % 256); 598#L59-1 mp_add_~nb~0#1 := 4; 619#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 604#L71 assume !(0 == mp_add_~b2~0#1 % 256); 605#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 664#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 663#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 662#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 655#L84-2 [2022-07-13 03:26:20,736 INFO L754 eck$LassoCheckResult]: Loop: 655#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 661#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 657#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 656#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 599#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 601#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 620#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 607#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 608#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 631#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 634#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 638#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 650#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 655#L84-2 [2022-07-13 03:26:20,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 1 times [2022-07-13 03:26:20,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:20,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379617563] [2022-07-13 03:26:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:20,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:20,779 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:20,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:20,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1921567616, now seen corresponding path program 3 times [2022-07-13 03:26:20,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:20,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309375309] [2022-07-13 03:26:20,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:20,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:20,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:20,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309375309] [2022-07-13 03:26:20,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309375309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:20,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:20,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:26:20,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816351296] [2022-07-13 03:26:20,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:20,860 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:20,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:20,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:20,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:26:20,861 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. cyclomatic complexity: 29 Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:21,043 INFO L93 Difference]: Finished difference Result 98 states and 142 transitions. [2022-07-13 03:26:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:26:21,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 142 transitions. [2022-07-13 03:26:21,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2022-07-13 03:26:21,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 142 transitions. [2022-07-13 03:26:21,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2022-07-13 03:26:21,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2022-07-13 03:26:21,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 142 transitions. [2022-07-13 03:26:21,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:21,047 INFO L369 hiAutomatonCegarLoop]: Abstraction has 98 states and 142 transitions. [2022-07-13 03:26:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 142 transitions. [2022-07-13 03:26:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2022-07-13 03:26:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 89 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) [2022-07-13 03:26:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2022-07-13 03:26:21,053 INFO L392 hiAutomatonCegarLoop]: Abstraction has 90 states and 128 transitions. [2022-07-13 03:26:21,053 INFO L374 stractBuchiCegarLoop]: Abstraction has 90 states and 128 transitions. [2022-07-13 03:26:21,053 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:26:21,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 128 transitions. [2022-07-13 03:26:21,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2022-07-13 03:26:21,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:21,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:21,054 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:21,055 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:21,055 INFO L752 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 783#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 770#L59 assume !(0 == mp_add_~a3~0#1 % 256); 771#L59-1 mp_add_~nb~0#1 := 4; 790#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 777#L71 assume !(0 == mp_add_~b2~0#1 % 256); 778#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 814#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 811#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 812#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 815#L84-2 [2022-07-13 03:26:21,055 INFO L754 eck$LassoCheckResult]: Loop: 815#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 816#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 784#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 785#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 772#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 774#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 791#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 780#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 781#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 805#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 806#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 821#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 834#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 850#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 824#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 822#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 823#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 803#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 804#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 846#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 845#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 844#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 815#L84-2 [2022-07-13 03:26:21,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:21,056 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 2 times [2022-07-13 03:26:21,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:21,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119412138] [2022-07-13 03:26:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:21,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:21,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:21,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:21,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:21,095 INFO L85 PathProgramCache]: Analyzing trace with hash 93570923, now seen corresponding path program 1 times [2022-07-13 03:26:21,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:21,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224735603] [2022-07-13 03:26:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:21,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 03:26:21,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:21,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224735603] [2022-07-13 03:26:21,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224735603] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:21,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:21,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:26:21,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665213217] [2022-07-13 03:26:21,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:21,121 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:21,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:21,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:26:21,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:26:21,122 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:21,197 INFO L93 Difference]: Finished difference Result 125 states and 174 transitions. [2022-07-13 03:26:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:26:21,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 174 transitions. [2022-07-13 03:26:21,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 106 [2022-07-13 03:26:21,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 174 transitions. [2022-07-13 03:26:21,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-07-13 03:26:21,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-07-13 03:26:21,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 174 transitions. [2022-07-13 03:26:21,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:21,201 INFO L369 hiAutomatonCegarLoop]: Abstraction has 125 states and 174 transitions. [2022-07-13 03:26:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 174 transitions. [2022-07-13 03:26:21,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-07-13 03:26:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.3983739837398375) internal successors, (172), 122 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2022-07-13 03:26:21,206 INFO L392 hiAutomatonCegarLoop]: Abstraction has 123 states and 172 transitions. [2022-07-13 03:26:21,206 INFO L374 stractBuchiCegarLoop]: Abstraction has 123 states and 172 transitions. [2022-07-13 03:26:21,206 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:26:21,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 172 transitions. [2022-07-13 03:26:21,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 104 [2022-07-13 03:26:21,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:21,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:21,208 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:21,208 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:21,208 INFO L752 eck$LassoCheckResult]: Stem: 1016#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 1004#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 991#L59 assume !(0 == mp_add_~a3~0#1 % 256); 992#L59-1 mp_add_~nb~0#1 := 4; 1011#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 998#L71 assume !(0 == mp_add_~b2~0#1 % 256); 999#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1106#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1101#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1063#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1061#L84-2 [2022-07-13 03:26:21,208 INFO L754 eck$LassoCheckResult]: Loop: 1061#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1059#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1058#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1056#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1048#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1044#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1043#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1042#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1041#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1040#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1036#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1037#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1006#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 993#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 995#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1035#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 1001#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1002#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1025#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1028#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1039#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1086#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1061#L84-2 [2022-07-13 03:26:21,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:21,209 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 3 times [2022-07-13 03:26:21,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:21,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802571579] [2022-07-13 03:26:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:21,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:21,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:21,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:21,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:21,274 INFO L85 PathProgramCache]: Analyzing trace with hash 150829225, now seen corresponding path program 1 times [2022-07-13 03:26:21,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:21,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89450050] [2022-07-13 03:26:21,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:21,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 03:26:21,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:21,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89450050] [2022-07-13 03:26:21,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89450050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:21,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:21,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:26:21,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633552488] [2022-07-13 03:26:21,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:21,327 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:21,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:21,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:21,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:26:21,328 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. cyclomatic complexity: 51 Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:21,476 INFO L93 Difference]: Finished difference Result 174 states and 242 transitions. [2022-07-13 03:26:21,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 03:26:21,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 242 transitions. [2022-07-13 03:26:21,479 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 155 [2022-07-13 03:26:21,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 242 transitions. [2022-07-13 03:26:21,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-07-13 03:26:21,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-07-13 03:26:21,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 242 transitions. [2022-07-13 03:26:21,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:21,481 INFO L369 hiAutomatonCegarLoop]: Abstraction has 174 states and 242 transitions. [2022-07-13 03:26:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 242 transitions. [2022-07-13 03:26:21,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 120. [2022-07-13 03:26:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.4) internal successors, (168), 119 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2022-07-13 03:26:21,487 INFO L392 hiAutomatonCegarLoop]: Abstraction has 120 states and 168 transitions. [2022-07-13 03:26:21,487 INFO L374 stractBuchiCegarLoop]: Abstraction has 120 states and 168 transitions. [2022-07-13 03:26:21,487 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:26:21,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 168 transitions. [2022-07-13 03:26:21,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 101 [2022-07-13 03:26:21,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:21,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:21,489 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:21,489 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:21,489 INFO L752 eck$LassoCheckResult]: Stem: 1323#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 1311#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 1298#L59 assume !(0 == mp_add_~a3~0#1 % 256); 1299#L59-1 mp_add_~nb~0#1 := 4; 1318#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 1305#L71 assume !(0 == mp_add_~b2~0#1 % 256); 1306#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1325#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1326#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1407#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1399#L84-2 [2022-07-13 03:26:21,489 INFO L754 eck$LassoCheckResult]: Loop: 1399#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1404#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1401#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1386#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1381#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1341#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1319#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1308#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1309#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1331#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1332#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1337#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1313#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1357#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1355#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1354#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1352#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 1350#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1349#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1347#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1348#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1377#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1399#L84-2 [2022-07-13 03:26:21,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:21,489 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 4 times [2022-07-13 03:26:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:21,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256932473] [2022-07-13 03:26:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:21,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:21,521 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:21,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:21,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:21,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1868578285, now seen corresponding path program 1 times [2022-07-13 03:26:21,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:21,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822164025] [2022-07-13 03:26:21,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:21,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 03:26:21,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:21,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822164025] [2022-07-13 03:26:21,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822164025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:21,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:21,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:26:21,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827632487] [2022-07-13 03:26:21,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:21,620 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:21,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:21,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:21,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:26:21,621 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. cyclomatic complexity: 50 Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:21,776 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2022-07-13 03:26:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 03:26:21,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 311 transitions. [2022-07-13 03:26:21,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 201 [2022-07-13 03:26:21,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 220 states and 311 transitions. [2022-07-13 03:26:21,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2022-07-13 03:26:21,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2022-07-13 03:26:21,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 311 transitions. [2022-07-13 03:26:21,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:21,781 INFO L369 hiAutomatonCegarLoop]: Abstraction has 220 states and 311 transitions. [2022-07-13 03:26:21,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 311 transitions. [2022-07-13 03:26:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 177. [2022-07-13 03:26:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 177 states have (on average 1.423728813559322) internal successors, (252), 176 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 252 transitions. [2022-07-13 03:26:21,795 INFO L392 hiAutomatonCegarLoop]: Abstraction has 177 states and 252 transitions. [2022-07-13 03:26:21,795 INFO L374 stractBuchiCegarLoop]: Abstraction has 177 states and 252 transitions. [2022-07-13 03:26:21,795 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:26:21,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 252 transitions. [2022-07-13 03:26:21,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 158 [2022-07-13 03:26:21,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:21,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:21,799 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:21,799 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:21,800 INFO L752 eck$LassoCheckResult]: Stem: 1677#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 1662#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 1654#L59 assume !(0 == mp_add_~a3~0#1 % 256); 1655#L59-1 mp_add_~nb~0#1 := 4; 1671#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 1658#L71 assume !(0 == mp_add_~b2~0#1 % 256); 1659#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1680#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1681#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1674#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1675#L84-2 [2022-07-13 03:26:21,800 INFO L754 eck$LassoCheckResult]: Loop: 1675#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1782#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1779#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1749#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1748#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1698#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1672#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1656#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1657#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1684#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1687#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1765#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1763#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1715#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1713#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1712#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1709#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1707#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1706#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1704#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1705#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1735#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1675#L84-2 [2022-07-13 03:26:21,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:21,801 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 5 times [2022-07-13 03:26:21,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:21,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417507288] [2022-07-13 03:26:21,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:21,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:21,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:21,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:21,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1925836587, now seen corresponding path program 1 times [2022-07-13 03:26:21,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:21,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230350334] [2022-07-13 03:26:21,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:21,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:21,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:21,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230350334] [2022-07-13 03:26:21,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230350334] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:21,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810913884] [2022-07-13 03:26:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:21,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:21,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:22,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 03:26:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:22,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:26:22,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:22,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:22,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810913884] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:22,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:22,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-07-13 03:26:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862029811] [2022-07-13 03:26:22,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:22,469 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:22,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:22,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 03:26:22,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 03:26:22,469 INFO L87 Difference]: Start difference. First operand 177 states and 252 transitions. cyclomatic complexity: 77 Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:22,949 INFO L93 Difference]: Finished difference Result 327 states and 450 transitions. [2022-07-13 03:26:22,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 03:26:22,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 327 states and 450 transitions. [2022-07-13 03:26:22,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 273 [2022-07-13 03:26:22,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 327 states to 327 states and 450 transitions. [2022-07-13 03:26:22,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2022-07-13 03:26:22,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2022-07-13 03:26:22,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 327 states and 450 transitions. [2022-07-13 03:26:22,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:22,955 INFO L369 hiAutomatonCegarLoop]: Abstraction has 327 states and 450 transitions. [2022-07-13 03:26:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states and 450 transitions. [2022-07-13 03:26:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 213. [2022-07-13 03:26:22,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 213 states have (on average 1.403755868544601) internal successors, (299), 212 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 299 transitions. [2022-07-13 03:26:22,962 INFO L392 hiAutomatonCegarLoop]: Abstraction has 213 states and 299 transitions. [2022-07-13 03:26:22,963 INFO L374 stractBuchiCegarLoop]: Abstraction has 213 states and 299 transitions. [2022-07-13 03:26:22,963 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 03:26:22,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 213 states and 299 transitions. [2022-07-13 03:26:22,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 185 [2022-07-13 03:26:22,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:22,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:22,965 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:22,965 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-13 03:26:22,965 INFO L752 eck$LassoCheckResult]: Stem: 2328#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 2315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 2307#L59 assume !(0 == mp_add_~a3~0#1 % 256); 2308#L59-1 mp_add_~nb~0#1 := 4; 2322#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 2311#L71 assume !(0 == mp_add_~b2~0#1 % 256); 2312#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 2438#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2437#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2434#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 2433#L84-2 [2022-07-13 03:26:22,965 INFO L754 eck$LassoCheckResult]: Loop: 2433#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2432#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2430#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2427#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2424#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 2413#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 2411#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2410#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2409#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2408#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2405#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2402#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 2396#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2391#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 2389#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 2382#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 2381#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2380#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2379#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2378#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2376#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2375#L84 assume !(0 == mp_add_~i~0#1 % 256); 2373#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2371#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2367#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2364#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2360#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 2358#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 2357#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2356#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2355#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2354#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2352#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2353#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2422#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 2433#L84-2 [2022-07-13 03:26:22,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 6 times [2022-07-13 03:26:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:22,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245588274] [2022-07-13 03:26:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:22,984 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:23,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:23,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:23,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1960379948, now seen corresponding path program 1 times [2022-07-13 03:26:23,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:23,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823282172] [2022-07-13 03:26:23,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:23,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:23,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823282172] [2022-07-13 03:26:23,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823282172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:23,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:23,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 03:26:23,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446858784] [2022-07-13 03:26:23,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:23,069 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:23,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:23,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 03:26:23,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 03:26:23,070 INFO L87 Difference]: Start difference. First operand 213 states and 299 transitions. cyclomatic complexity: 88 Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:23,348 INFO L93 Difference]: Finished difference Result 448 states and 621 transitions. [2022-07-13 03:26:23,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 03:26:23,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 448 states and 621 transitions. [2022-07-13 03:26:23,353 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 392 [2022-07-13 03:26:23,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 448 states to 445 states and 617 transitions. [2022-07-13 03:26:23,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 445 [2022-07-13 03:26:23,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 445 [2022-07-13 03:26:23,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 445 states and 617 transitions. [2022-07-13 03:26:23,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:23,357 INFO L369 hiAutomatonCegarLoop]: Abstraction has 445 states and 617 transitions. [2022-07-13 03:26:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states and 617 transitions. [2022-07-13 03:26:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 372. [2022-07-13 03:26:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 372 states have (on average 1.403225806451613) internal successors, (522), 371 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 522 transitions. [2022-07-13 03:26:23,371 INFO L392 hiAutomatonCegarLoop]: Abstraction has 372 states and 522 transitions. [2022-07-13 03:26:23,371 INFO L374 stractBuchiCegarLoop]: Abstraction has 372 states and 522 transitions. [2022-07-13 03:26:23,371 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-13 03:26:23,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 372 states and 522 transitions. [2022-07-13 03:26:23,373 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 344 [2022-07-13 03:26:23,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:23,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:23,375 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:23,375 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-13 03:26:23,376 INFO L752 eck$LassoCheckResult]: Stem: 3007#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 2994#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 2981#L59 assume !(0 == mp_add_~a3~0#1 % 256); 2982#L59-1 mp_add_~nb~0#1 := 4; 3001#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 2988#L71 assume !(0 == mp_add_~b2~0#1 % 256); 2989#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 3025#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3146#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3137#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 3135#L84-2 [2022-07-13 03:26:23,376 INFO L754 eck$LassoCheckResult]: Loop: 3135#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3134#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3132#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3128#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3123#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 3121#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 3120#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3119#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3118#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3045#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3046#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3117#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3116#L84 assume !(0 == mp_add_~i~0#1 % 256); 3115#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 3114#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3112#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3108#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3103#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 3101#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 3100#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 3099#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3098#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3097#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3096#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3094#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3093#L84 assume !(0 == mp_add_~i~0#1 % 256); 3092#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3091#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3087#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3082#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3084#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 3251#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 3054#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3052#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3049#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3050#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3038#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3039#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3147#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 3135#L84-2 [2022-07-13 03:26:23,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 7 times [2022-07-13 03:26:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:23,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028045599] [2022-07-13 03:26:23,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:23,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:23,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:23,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:23,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:23,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1024241828, now seen corresponding path program 1 times [2022-07-13 03:26:23,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:23,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416377793] [2022-07-13 03:26:23,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:23,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:23,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:23,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416377793] [2022-07-13 03:26:23,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416377793] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:23,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328276546] [2022-07-13 03:26:23,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:23,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:23,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:23,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:23,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 03:26:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:23,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:26:23,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 03:26:23,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 03:26:23,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328276546] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:23,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:23,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2022-07-13 03:26:23,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340019385] [2022-07-13 03:26:23,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:23,677 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:23,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:23,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 03:26:23,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-13 03:26:23,679 INFO L87 Difference]: Start difference. First operand 372 states and 522 transitions. cyclomatic complexity: 153 Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:24,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:24,187 INFO L93 Difference]: Finished difference Result 599 states and 800 transitions. [2022-07-13 03:26:24,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 03:26:24,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 599 states and 800 transitions. [2022-07-13 03:26:24,191 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 564 [2022-07-13 03:26:24,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 599 states to 598 states and 799 transitions. [2022-07-13 03:26:24,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 598 [2022-07-13 03:26:24,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 598 [2022-07-13 03:26:24,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 598 states and 799 transitions. [2022-07-13 03:26:24,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:24,196 INFO L369 hiAutomatonCegarLoop]: Abstraction has 598 states and 799 transitions. [2022-07-13 03:26:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states and 799 transitions. [2022-07-13 03:26:24,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 364. [2022-07-13 03:26:24,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 364 states have (on average 1.3626373626373627) internal successors, (496), 363 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:24,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 496 transitions. [2022-07-13 03:26:24,204 INFO L392 hiAutomatonCegarLoop]: Abstraction has 364 states and 496 transitions. [2022-07-13 03:26:24,204 INFO L374 stractBuchiCegarLoop]: Abstraction has 364 states and 496 transitions. [2022-07-13 03:26:24,204 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-13 03:26:24,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 364 states and 496 transitions. [2022-07-13 03:26:24,206 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 336 [2022-07-13 03:26:24,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:24,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:24,206 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:24,207 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:24,207 INFO L752 eck$LassoCheckResult]: Stem: 4232#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 4217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 4209#L59 assume !(0 == mp_add_~a3~0#1 % 256); 4210#L59-1 mp_add_~nb~0#1 := 4; 4224#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 4213#L71 assume !(0 == mp_add_~b2~0#1 % 256); 4214#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4331#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4329#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4330#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 4395#L84-2 [2022-07-13 03:26:24,207 INFO L754 eck$LassoCheckResult]: Loop: 4395#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4531#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4530#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4308#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4307#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4282#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 4283#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4278#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4279#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4274#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4275#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4524#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4544#L84 assume !(0 == mp_add_~i~0#1 % 256); 4520#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 4393#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4518#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4514#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4511#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4509#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4499#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 4364#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4365#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4328#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4316#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4247#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4219#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4204#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4206#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4225#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4226#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 4260#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4318#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4301#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4302#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4472#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4469#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4467#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4450#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4211#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4212#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 4437#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4233#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4234#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4523#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4375#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4532#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4466#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4464#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4239#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4240#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4241#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4389#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4376#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4370#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4367#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4368#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4413#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4412#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4411#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4410#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4409#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4408#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4336#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4263#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4261#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4259#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4258#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4257#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4255#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4256#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4394#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 4395#L84-2 [2022-07-13 03:26:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:24,207 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 8 times [2022-07-13 03:26:24,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:24,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870090499] [2022-07-13 03:26:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:24,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:24,219 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:24,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:24,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:24,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1261898314, now seen corresponding path program 1 times [2022-07-13 03:26:24,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:24,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045074293] [2022-07-13 03:26:24,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:24,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 03:26:24,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:24,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045074293] [2022-07-13 03:26:24,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045074293] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:24,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437392243] [2022-07-13 03:26:24,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:24,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:24,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:24,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 03:26:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:24,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:26:24,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 03:26:24,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 03:26:24,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437392243] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:24,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:24,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-13 03:26:24,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118947445] [2022-07-13 03:26:24,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:24,597 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:24,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:24,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:26:24,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:26:24,598 INFO L87 Difference]: Start difference. First operand 364 states and 496 transitions. cyclomatic complexity: 135 Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:24,744 INFO L93 Difference]: Finished difference Result 776 states and 1026 transitions. [2022-07-13 03:26:24,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 03:26:24,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 776 states and 1026 transitions. [2022-07-13 03:26:24,750 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 739 [2022-07-13 03:26:24,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 776 states to 776 states and 1026 transitions. [2022-07-13 03:26:24,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 776 [2022-07-13 03:26:24,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 776 [2022-07-13 03:26:24,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 776 states and 1026 transitions. [2022-07-13 03:26:24,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:24,755 INFO L369 hiAutomatonCegarLoop]: Abstraction has 776 states and 1026 transitions. [2022-07-13 03:26:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states and 1026 transitions. [2022-07-13 03:26:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 463. [2022-07-13 03:26:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 463 states have (on average 1.3585313174946003) internal successors, (629), 462 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 629 transitions. [2022-07-13 03:26:24,764 INFO L392 hiAutomatonCegarLoop]: Abstraction has 463 states and 629 transitions. [2022-07-13 03:26:24,764 INFO L374 stractBuchiCegarLoop]: Abstraction has 463 states and 629 transitions. [2022-07-13 03:26:24,764 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-13 03:26:24,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 463 states and 629 transitions. [2022-07-13 03:26:24,767 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 435 [2022-07-13 03:26:24,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:24,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:24,768 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:24,768 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:24,768 INFO L752 eck$LassoCheckResult]: Stem: 5809#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 5796#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 5780#L59 assume !(0 == mp_add_~a3~0#1 % 256); 5781#L59-1 mp_add_~nb~0#1 := 4; 5803#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 5789#L71 assume !(0 == mp_add_~b2~0#1 % 256); 5790#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 5886#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5887#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6141#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 5837#L84-2 [2022-07-13 03:26:24,768 INFO L754 eck$LassoCheckResult]: Loop: 5837#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6139#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6137#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6134#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6130#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 6131#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 6146#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6145#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6132#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6128#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6126#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6123#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5807#L84 assume !(0 == mp_add_~i~0#1 % 256); 5808#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 6057#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6205#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6204#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5782#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 5783#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 5794#L96-8 mp_add_~carry~0#1 := 1; 5795#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6224#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 5885#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6211#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6190#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6191#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6184#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6183#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5788#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6216#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 6215#L96-8 mp_add_~carry~0#1 := 1; 6214#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6213#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6207#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 5848#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6194#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6195#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6066#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5798#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6199#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6196#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 6182#L96-8 mp_add_~carry~0#1 := 1; 6156#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6153#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6150#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6147#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 6109#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6107#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6104#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6101#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6030#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6077#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 6072#L96-8 mp_add_~carry~0#1 := 1; 6069#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6063#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6062#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6061#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5877#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6035#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6033#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6031#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6026#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6023#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 6022#L96-8 mp_add_~carry~0#1 := 1; 5888#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5889#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5883#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5882#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5876#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5875#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5871#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5866#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5868#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 5880#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5850#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5852#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5845#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5846#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5841#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5839#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5836#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 5837#L84-2 [2022-07-13 03:26:24,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 9 times [2022-07-13 03:26:24,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:24,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288001210] [2022-07-13 03:26:24,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:24,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:24,778 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:24,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:24,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash -946314949, now seen corresponding path program 1 times [2022-07-13 03:26:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:24,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198702248] [2022-07-13 03:26:24,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-13 03:26:24,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:24,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198702248] [2022-07-13 03:26:24,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198702248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:24,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:24,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:26:24,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523624528] [2022-07-13 03:26:24,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:24,815 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:24,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:24,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:24,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:26:24,815 INFO L87 Difference]: Start difference. First operand 463 states and 629 transitions. cyclomatic complexity: 169 Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:24,871 INFO L93 Difference]: Finished difference Result 639 states and 830 transitions. [2022-07-13 03:26:24,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:26:24,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 639 states and 830 transitions. [2022-07-13 03:26:24,876 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 553 [2022-07-13 03:26:24,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 639 states to 587 states and 778 transitions. [2022-07-13 03:26:24,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 587 [2022-07-13 03:26:24,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 587 [2022-07-13 03:26:24,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 587 states and 778 transitions. [2022-07-13 03:26:24,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:24,881 INFO L369 hiAutomatonCegarLoop]: Abstraction has 587 states and 778 transitions. [2022-07-13 03:26:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states and 778 transitions. [2022-07-13 03:26:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 440. [2022-07-13 03:26:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 440 states have (on average 1.3454545454545455) internal successors, (592), 439 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 592 transitions. [2022-07-13 03:26:24,889 INFO L392 hiAutomatonCegarLoop]: Abstraction has 440 states and 592 transitions. [2022-07-13 03:26:24,889 INFO L374 stractBuchiCegarLoop]: Abstraction has 440 states and 592 transitions. [2022-07-13 03:26:24,889 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-13 03:26:24,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 440 states and 592 transitions. [2022-07-13 03:26:24,891 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 412 [2022-07-13 03:26:24,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:24,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:24,892 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:24,892 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:24,893 INFO L752 eck$LassoCheckResult]: Stem: 6916#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 6903#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 6889#L59 assume !(0 == mp_add_~a3~0#1 % 256); 6890#L59-1 mp_add_~nb~0#1 := 4; 6911#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 6896#L71 assume !(0 == mp_add_~b2~0#1 % 256); 6897#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 6918#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6919#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7263#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 7251#L84-2 [2022-07-13 03:26:24,893 INFO L754 eck$LassoCheckResult]: Loop: 7251#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 7247#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7243#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7234#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7232#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 7230#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 7225#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7221#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7222#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7311#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6998#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6999#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7300#L84 assume !(0 == mp_add_~i~0#1 % 256); 7295#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 7023#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6904#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6905#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6895#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6907#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 6901#L96-8 mp_add_~carry~0#1 := 1; 6902#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7307#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 6990#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7306#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7303#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7301#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6931#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6932#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6891#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 6892#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6912#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6899#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 6900#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6924#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6927#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6951#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7238#L84 assume !(0 == mp_add_~i~0#1 % 256); 7304#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6920#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6921#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 7236#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7202#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 7289#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 7287#L96-8 mp_add_~carry~0#1 := 1; 7286#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7285#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7284#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7283#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 6985#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6995#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6996#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7192#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7171#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 7012#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7165#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7060#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7058#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7029#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7027#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7025#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7024#L84 assume !(0 == mp_add_~i~0#1 % 256); 7022#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 7020#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7018#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7016#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7015#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 7149#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 7148#L96-8 mp_add_~carry~0#1 := 1; 7147#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6989#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6991#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6983#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6984#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6978#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6979#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6973#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6975#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 6969#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6970#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6964#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6965#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6959#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6960#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7028#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7256#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 7251#L84-2 [2022-07-13 03:26:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 10 times [2022-07-13 03:26:24,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:24,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718071867] [2022-07-13 03:26:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:24,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:24,902 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:24,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:24,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:24,912 INFO L85 PathProgramCache]: Analyzing trace with hash -110068253, now seen corresponding path program 1 times [2022-07-13 03:26:24,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:24,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048280340] [2022-07-13 03:26:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:24,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-13 03:26:25,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:25,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048280340] [2022-07-13 03:26:25,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048280340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:25,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:25,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 03:26:25,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827052240] [2022-07-13 03:26:25,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:25,020 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:25,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:25,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:26:25,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:26:25,021 INFO L87 Difference]: Start difference. First operand 440 states and 592 transitions. cyclomatic complexity: 155 Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:25,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:25,410 INFO L93 Difference]: Finished difference Result 737 states and 972 transitions. [2022-07-13 03:26:25,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 03:26:25,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 737 states and 972 transitions. [2022-07-13 03:26:25,415 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 658 [2022-07-13 03:26:25,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 737 states to 735 states and 969 transitions. [2022-07-13 03:26:25,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 735 [2022-07-13 03:26:25,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 735 [2022-07-13 03:26:25,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 735 states and 969 transitions. [2022-07-13 03:26:25,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:25,421 INFO L369 hiAutomatonCegarLoop]: Abstraction has 735 states and 969 transitions. [2022-07-13 03:26:25,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states and 969 transitions. [2022-07-13 03:26:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 609. [2022-07-13 03:26:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 609 states have (on average 1.3497536945812807) internal successors, (822), 608 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 822 transitions. [2022-07-13 03:26:25,431 INFO L392 hiAutomatonCegarLoop]: Abstraction has 609 states and 822 transitions. [2022-07-13 03:26:25,432 INFO L374 stractBuchiCegarLoop]: Abstraction has 609 states and 822 transitions. [2022-07-13 03:26:25,432 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-13 03:26:25,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 609 states and 822 transitions. [2022-07-13 03:26:25,434 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 581 [2022-07-13 03:26:25,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:25,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:25,435 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:25,435 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:25,436 INFO L752 eck$LassoCheckResult]: Stem: 8118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 8105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 8091#L59 assume !(0 == mp_add_~a3~0#1 % 256); 8092#L59-1 mp_add_~nb~0#1 := 4; 8113#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 8098#L71 assume !(0 == mp_add_~b2~0#1 % 256); 8099#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 8136#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8447#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8445#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 8443#L84-2 [2022-07-13 03:26:25,436 INFO L754 eck$LassoCheckResult]: Loop: 8443#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8442#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8440#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8436#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8430#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8432#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 8425#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8426#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8678#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8676#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8674#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8419#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8418#L84 assume !(0 == mp_add_~i~0#1 % 256); 8417#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 8222#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8415#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8412#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8406#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8408#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8650#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 8255#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8649#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8648#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8383#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8384#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8379#L84 assume !(0 == mp_add_~i~0#1 % 256); 8371#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8367#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 8220#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8365#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8361#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8362#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8397#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8395#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 8394#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8393#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8392#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8390#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8340#L84 assume !(0 == mp_add_~i~0#1 % 256); 8389#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8388#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8387#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 8386#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8336#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 8319#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 8314#L96-8 mp_add_~carry~0#1 := 1; 8310#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8303#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8297#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8293#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 8194#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8289#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8288#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8284#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8285#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8359#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8396#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8251#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8248#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8230#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8227#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8228#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8448#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 8278#L90 assume !(0 == mp_add_~i~0#1 % 256); 8276#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 8272#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 8273#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 8360#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 8260#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 8201#L96-8 mp_add_~carry~0#1 := 1; 8202#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8197#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8195#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8192#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8193#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8241#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8239#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8237#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8236#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8235#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8234#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8233#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8232#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8231#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8229#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8224#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8225#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 8443#L84-2 [2022-07-13 03:26:25,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:25,437 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 11 times [2022-07-13 03:26:25,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:25,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327085452] [2022-07-13 03:26:25,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:25,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:25,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:25,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:25,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:25,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1842182454, now seen corresponding path program 1 times [2022-07-13 03:26:25,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:25,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151666127] [2022-07-13 03:26:25,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:25,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 107 proven. 64 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 03:26:25,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:25,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151666127] [2022-07-13 03:26:25,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151666127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:25,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101303897] [2022-07-13 03:26:25,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:25,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:25,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:25,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:25,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 03:26:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:25,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 03:26:25,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 03:26:25,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:26:25,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101303897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:25,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 03:26:25,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-13 03:26:25,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885656804] [2022-07-13 03:26:25,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:25,697 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:25,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:25,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:25,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 03:26:25,698 INFO L87 Difference]: Start difference. First operand 609 states and 822 transitions. cyclomatic complexity: 217 Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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) [2022-07-13 03:26:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:25,791 INFO L93 Difference]: Finished difference Result 1047 states and 1364 transitions. [2022-07-13 03:26:25,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:26:25,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1047 states and 1364 transitions. [2022-07-13 03:26:25,799 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 895 [2022-07-13 03:26:25,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1047 states to 1035 states and 1349 transitions. [2022-07-13 03:26:25,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1035 [2022-07-13 03:26:25,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1035 [2022-07-13 03:26:25,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1035 states and 1349 transitions. [2022-07-13 03:26:25,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:25,806 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1035 states and 1349 transitions. [2022-07-13 03:26:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states and 1349 transitions. [2022-07-13 03:26:25,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 844. [2022-07-13 03:26:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 844 states have (on average 1.3270142180094786) internal successors, (1120), 843 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1120 transitions. [2022-07-13 03:26:25,822 INFO L392 hiAutomatonCegarLoop]: Abstraction has 844 states and 1120 transitions. [2022-07-13 03:26:25,822 INFO L374 stractBuchiCegarLoop]: Abstraction has 844 states and 1120 transitions. [2022-07-13 03:26:25,823 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-13 03:26:25,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 844 states and 1120 transitions. [2022-07-13 03:26:25,826 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 743 [2022-07-13 03:26:25,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:25,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:25,827 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:25,828 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:25,828 INFO L752 eck$LassoCheckResult]: Stem: 10042#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 10028#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 10014#L59 assume !(0 == mp_add_~a3~0#1 % 256); 10015#L59-1 mp_add_~nb~0#1 := 4; 10037#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 10021#L71 assume !(0 == mp_add_~b2~0#1 % 256); 10022#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 10060#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10360#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 10357#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 10358#L84-2 [2022-07-13 03:26:25,828 INFO L754 eck$LassoCheckResult]: Loop: 10358#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 10353#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 10354#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 10769#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 10767#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 10766#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 10765#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 10763#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 10759#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 10755#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 10751#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10749#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10747#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10745#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10742#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10743#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 10738#L84 assume !(0 == mp_add_~i~0#1 % 256); 10737#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 10138#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 10735#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 10733#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 10730#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 10728#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10726#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 10540#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10576#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10577#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10721#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10720#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 10566#L84 assume !(0 == mp_add_~i~0#1 % 256); 10565#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 10564#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 10214#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 10560#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 10556#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 10554#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10552#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10549#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 10508#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10509#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10504#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10505#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 10500#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 10494#L90 assume !(0 == mp_add_~i~0#1 % 256); 10497#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 10495#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 10492#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 10489#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 10486#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 10485#L96-8 mp_add_~carry~0#1 := 1; 10484#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10483#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10482#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10481#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 10113#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10445#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10478#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 10479#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 10365#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 10366#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10341#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10209#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10208#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10092#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10150#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10151#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 10211#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 10210#L90 assume !(0 == mp_add_~i~0#1 % 256); 10147#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 10149#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 10203#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 10529#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 10524#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 10520#L96-8 mp_add_~carry~0#1 := 1; 10518#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10516#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10114#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10112#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10110#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10111#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10105#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 10107#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 10101#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 10102#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10096#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10098#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10090#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10091#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10152#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10153#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 10359#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 10358#L84-2 [2022-07-13 03:26:25,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:25,831 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 12 times [2022-07-13 03:26:25,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:25,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199970275] [2022-07-13 03:26:25,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:25,842 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:25,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash -713828190, now seen corresponding path program 1 times [2022-07-13 03:26:25,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:25,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668642354] [2022-07-13 03:26:25,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:25,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 142 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 03:26:25,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:25,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668642354] [2022-07-13 03:26:25,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668642354] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:25,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061967011] [2022-07-13 03:26:25,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:25,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:25,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:25,940 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) [2022-07-13 03:26:25,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 03:26:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:25,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:26:26,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 148 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-13 03:26:26,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 148 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-13 03:26:26,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061967011] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:26,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:26,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-07-13 03:26:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580713703] [2022-07-13 03:26:26,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:26,188 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:26,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 03:26:26,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-13 03:26:26,188 INFO L87 Difference]: Start difference. First operand 844 states and 1120 transitions. cyclomatic complexity: 281 Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:27,072 INFO L93 Difference]: Finished difference Result 2651 states and 3555 transitions. [2022-07-13 03:26:27,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 03:26:27,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2651 states and 3555 transitions. [2022-07-13 03:26:27,091 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 2057 [2022-07-13 03:26:27,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2651 states to 2589 states and 3469 transitions. [2022-07-13 03:26:27,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2589 [2022-07-13 03:26:27,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2589 [2022-07-13 03:26:27,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2589 states and 3469 transitions. [2022-07-13 03:26:27,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:27,112 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2589 states and 3469 transitions. [2022-07-13 03:26:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states and 3469 transitions. [2022-07-13 03:26:27,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2114. [2022-07-13 03:26:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2114 states have (on average 1.378902554399243) internal successors, (2915), 2113 states have internal predecessors, (2915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2915 transitions. [2022-07-13 03:26:27,158 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2114 states and 2915 transitions. [2022-07-13 03:26:27,158 INFO L374 stractBuchiCegarLoop]: Abstraction has 2114 states and 2915 transitions. [2022-07-13 03:26:27,158 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-13 03:26:27,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2114 states and 2915 transitions. [2022-07-13 03:26:27,167 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1869 [2022-07-13 03:26:27,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:27,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:27,168 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:27,168 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:27,169 INFO L752 eck$LassoCheckResult]: Stem: 14138#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 14123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 14114#L59 assume !(0 == mp_add_~a3~0#1 % 256); 14115#L59-1 mp_add_~nb~0#1 := 4; 14131#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 14118#L71 assume !(0 == mp_add_~b2~0#1 % 256); 14119#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 14139#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14140#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14703#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 14704#L84-2 [2022-07-13 03:26:27,169 INFO L754 eck$LassoCheckResult]: Loop: 14704#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 16130#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 16128#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 16127#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14698#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 14697#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 14696#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 14694#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 14689#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 14691#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 14684#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14685#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14681#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14680#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14678#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14679#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14673#L84 assume !(0 == mp_add_~i~0#1 % 256); 14671#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 14400#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 14667#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 14668#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14664#L90 assume !(0 == mp_add_~i~0#1 % 256); 14663#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 14560#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 14662#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 14655#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 14647#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14648#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 14266#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14642#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14634#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14635#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14674#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14672#L84 assume !(0 == mp_add_~i~0#1 % 256); 14608#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 14607#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 14398#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 14603#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14601#L90 assume !(0 == mp_add_~i~0#1 % 256); 14602#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 14590#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 14379#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 14584#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 14586#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14573#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14574#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 14512#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14513#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14505#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14506#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 14481#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14480#L90 assume !(0 == mp_add_~i~0#1 % 256); 14479#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 14478#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 14477#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 14475#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 14476#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 14529#L96-8 mp_add_~carry~0#1 := 1; 14528#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14527#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14526#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14455#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 14420#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14451#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14449#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 14450#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 14490#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 14540#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14539#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14424#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14423#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14289#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14404#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14405#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 14705#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14387#L90 assume !(0 == mp_add_~i~0#1 % 256); 14383#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 14384#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 14372#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 14373#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 14436#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 14433#L96-8 mp_add_~carry~0#1 := 1; 14430#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14431#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14421#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14419#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14418#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14417#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14415#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 14413#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 14412#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 14411#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14410#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14409#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14408#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14407#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14406#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14402#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14403#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 14704#L84-2 [2022-07-13 03:26:27,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 13 times [2022-07-13 03:26:27,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:27,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023498678] [2022-07-13 03:26:27,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:27,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:27,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:27,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:27,196 INFO L85 PathProgramCache]: Analyzing trace with hash 883914334, now seen corresponding path program 1 times [2022-07-13 03:26:27,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:27,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597634912] [2022-07-13 03:26:27,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:27,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-13 03:26:27,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:27,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597634912] [2022-07-13 03:26:27,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597634912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:27,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:27,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:26:27,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528625832] [2022-07-13 03:26:27,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:27,234 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:27,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:27,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:26:27,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:26:27,235 INFO L87 Difference]: Start difference. First operand 2114 states and 2915 transitions. cyclomatic complexity: 812 Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:27,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:27,280 INFO L93 Difference]: Finished difference Result 2114 states and 2846 transitions. [2022-07-13 03:26:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:26:27,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2114 states and 2846 transitions. [2022-07-13 03:26:27,292 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1869 [2022-07-13 03:26:27,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2114 states to 2114 states and 2846 transitions. [2022-07-13 03:26:27,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2114 [2022-07-13 03:26:27,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2114 [2022-07-13 03:26:27,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2114 states and 2846 transitions. [2022-07-13 03:26:27,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:27,306 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2114 states and 2846 transitions. [2022-07-13 03:26:27,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states and 2846 transitions. [2022-07-13 03:26:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2022-07-13 03:26:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2114 states have (on average 1.346263008514664) internal successors, (2846), 2113 states have internal predecessors, (2846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2846 transitions. [2022-07-13 03:26:27,343 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2114 states and 2846 transitions. [2022-07-13 03:26:27,343 INFO L374 stractBuchiCegarLoop]: Abstraction has 2114 states and 2846 transitions. [2022-07-13 03:26:27,343 INFO L287 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-13 03:26:27,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2114 states and 2846 transitions. [2022-07-13 03:26:27,352 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1869 [2022-07-13 03:26:27,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:27,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:27,353 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:27,353 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:27,353 INFO L752 eck$LassoCheckResult]: Stem: 18371#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 18356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 18347#L59 assume !(0 == mp_add_~a3~0#1 % 256); 18348#L59-1 mp_add_~nb~0#1 := 4; 18365#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 18351#L71 assume !(0 == mp_add_~b2~0#1 % 256); 18352#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 18372#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18373#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 19062#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 19061#L84-2 [2022-07-13 03:26:27,354 INFO L754 eck$LassoCheckResult]: Loop: 19061#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 19060#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 19058#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 19059#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19056#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 19055#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 19053#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 19051#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 19047#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 19049#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 19042#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 19043#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 19038#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 19039#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 19034#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19035#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 19029#L84 assume !(0 == mp_add_~i~0#1 % 256); 19027#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 18644#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 19025#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 19021#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19019#L90 assume !(0 == mp_add_~i~0#1 % 256); 19017#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 18630#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 19014#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 19012#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 19007#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 19002#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 18499#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18997#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18995#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18991#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18992#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 19028#L84 assume !(0 == mp_add_~i~0#1 % 256); 18854#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 18853#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 18642#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 18849#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 18847#L90 assume !(0 == mp_add_~i~0#1 % 256); 18848#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 18843#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 18587#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 18839#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 18829#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18830#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18791#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 18792#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18785#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18786#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18779#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 18725#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 18724#L90 assume !(0 == mp_add_~i~0#1 % 256); 18723#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 18722#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 18721#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 18719#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 18718#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18717#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18716#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18715#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 18714#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18713#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18711#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18708#L84 assume !(0 == mp_add_~i~0#1 % 256); 18709#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 18699#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 18700#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 18689#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 18688#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 18674#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18669#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18670#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18653#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18526#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18649#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18650#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18645#L84 assume !(0 == mp_add_~i~0#1 % 256); 18643#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 18641#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 18639#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 18636#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 18620#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 18677#L96 assume !(0 == mp_add_~partial_sum~0#1); 18681#L96-2 assume !false; 18680#L96-4 assume !false; 18679#L96-6 assume !(mp_add_~partial_sum~0#1 >= 0);mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1; 18678#L96-8 mp_add_~carry~0#1 := 1; 18675#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18671#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18673#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18665#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18664#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18663#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18661#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 18659#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 18658#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 18657#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18656#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18654#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18652#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18651#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18648#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18646#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18647#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 19061#L84-2 [2022-07-13 03:26:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 14 times [2022-07-13 03:26:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:27,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418473484] [2022-07-13 03:26:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:27,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:27,362 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:27,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:27,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:27,371 INFO L85 PathProgramCache]: Analyzing trace with hash -845879228, now seen corresponding path program 1 times [2022-07-13 03:26:27,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:27,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274272158] [2022-07-13 03:26:27,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:27,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 154 proven. 7 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-13 03:26:27,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:27,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274272158] [2022-07-13 03:26:27,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274272158] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:27,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834007847] [2022-07-13 03:26:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:27,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:27,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:27,411 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) [2022-07-13 03:26:27,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 03:26:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:27,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:26:27,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 177 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 03:26:27,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 177 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 03:26:27,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834007847] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:27,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:27,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-07-13 03:26:27,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463207628] [2022-07-13 03:26:27,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:27,868 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:27,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 03:26:27,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-13 03:26:27,869 INFO L87 Difference]: Start difference. First operand 2114 states and 2846 transitions. cyclomatic complexity: 743 Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:30,087 INFO L93 Difference]: Finished difference Result 1202 states and 1506 transitions. [2022-07-13 03:26:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 03:26:30,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1202 states and 1506 transitions. [2022-07-13 03:26:30,095 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 784 [2022-07-13 03:26:30,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1202 states to 942 states and 1246 transitions. [2022-07-13 03:26:30,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 942 [2022-07-13 03:26:30,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 942 [2022-07-13 03:26:30,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 942 states and 1246 transitions. [2022-07-13 03:26:30,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:30,101 INFO L369 hiAutomatonCegarLoop]: Abstraction has 942 states and 1246 transitions. [2022-07-13 03:26:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states and 1246 transitions. [2022-07-13 03:26:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 652. [2022-07-13 03:26:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 652 states have (on average 1.3236196319018405) internal successors, (863), 651 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 863 transitions. [2022-07-13 03:26:30,112 INFO L392 hiAutomatonCegarLoop]: Abstraction has 652 states and 863 transitions. [2022-07-13 03:26:30,113 INFO L374 stractBuchiCegarLoop]: Abstraction has 652 states and 863 transitions. [2022-07-13 03:26:30,113 INFO L287 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-07-13 03:26:30,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 652 states and 863 transitions. [2022-07-13 03:26:30,115 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 561 [2022-07-13 03:26:30,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:30,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:30,116 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:30,116 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:30,116 INFO L752 eck$LassoCheckResult]: Stem: 22325#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 22315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 22303#L59 assume !(0 == mp_add_~a3~0#1 % 256); 22304#L59-1 mp_add_~nb~0#1 := 4; 22320#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 22310#L71 assume !(0 == mp_add_~b2~0#1 % 256); 22311#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 22392#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 22390#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 22388#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 22386#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 22385#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 22383#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 22380#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 22376#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 22377#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 22372#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 22373#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 22368#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 22369#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 22365#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 22339#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 22323#L84 assume !(0 == mp_add_~i~0#1 % 256); 22324#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 22329#L85-1 [2022-07-13 03:26:30,117 INFO L754 eck$LassoCheckResult]: Loop: 22329#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 22316#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 22317#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 22829#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 22953#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 22952#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 22403#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 22951#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 22950#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 22949#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 22948#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 22947#L84 assume !(0 == mp_add_~i~0#1 % 256); 22946#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 22931#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 22577#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 22930#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 22926#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 22925#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 22924#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 22698#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 22401#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 22696#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 22697#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 22940#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 22938#L84 assume !(0 == mp_add_~i~0#1 % 256); 22936#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 22934#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 22933#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 22343#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 22305#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 22306#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 22321#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 22313#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 22314#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 22334#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 22337#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 22358#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 22927#L84 assume !(0 == mp_add_~i~0#1 % 256); 22922#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 22329#L85-1 [2022-07-13 03:26:30,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash 19635510, now seen corresponding path program 1 times [2022-07-13 03:26:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:30,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173035368] [2022-07-13 03:26:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:30,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:30,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173035368] [2022-07-13 03:26:30,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173035368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:30,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:30,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 03:26:30,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127241994] [2022-07-13 03:26:30,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:30,172 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:30,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1205102556, now seen corresponding path program 1 times [2022-07-13 03:26:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:30,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724639455] [2022-07-13 03:26:30,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:30,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:30,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:30,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724639455] [2022-07-13 03:26:30,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724639455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:30,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000563159] [2022-07-13 03:26:30,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:30,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:30,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:30,231 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) [2022-07-13 03:26:30,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 03:26:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:30,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:26:30,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 03:26:30,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:26:30,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000563159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:30,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 03:26:30,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-13 03:26:30,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993431600] [2022-07-13 03:26:30,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:30,321 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:30,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:30,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 03:26:30,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 03:26:30,322 INFO L87 Difference]: Start difference. First operand 652 states and 863 transitions. cyclomatic complexity: 219 Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:30,581 INFO L93 Difference]: Finished difference Result 1898 states and 2521 transitions. [2022-07-13 03:26:30,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:26:30,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1898 states and 2521 transitions. [2022-07-13 03:26:30,590 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 1683 [2022-07-13 03:26:30,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1898 states to 1898 states and 2521 transitions. [2022-07-13 03:26:30,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1898 [2022-07-13 03:26:30,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1898 [2022-07-13 03:26:30,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1898 states and 2521 transitions. [2022-07-13 03:26:30,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:30,604 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1898 states and 2521 transitions. [2022-07-13 03:26:30,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states and 2521 transitions. [2022-07-13 03:26:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 652. [2022-07-13 03:26:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 652 states have (on average 1.3236196319018405) internal successors, (863), 651 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 863 transitions. [2022-07-13 03:26:30,622 INFO L392 hiAutomatonCegarLoop]: Abstraction has 652 states and 863 transitions. [2022-07-13 03:26:30,622 INFO L374 stractBuchiCegarLoop]: Abstraction has 652 states and 863 transitions. [2022-07-13 03:26:30,622 INFO L287 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-07-13 03:26:30,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 652 states and 863 transitions. [2022-07-13 03:26:30,625 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 561 [2022-07-13 03:26:30,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:30,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:30,626 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:30,626 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:30,626 INFO L752 eck$LassoCheckResult]: Stem: 25009#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 24997#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 24990#L59 assume !(0 == mp_add_~a3~0#1 % 256); 24991#L59-1 mp_add_~nb~0#1 := 4; 25002#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 24994#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 24996#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 25028#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 25074#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 25073#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 25072#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 25071#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 25070#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 25069#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 25066#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 25068#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 25346#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 25345#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 25344#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 25343#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 25342#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 25056#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 25057#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 25491#L84 assume !(0 == mp_add_~i~0#1 % 256); 25024#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 25025#L85-1 [2022-07-13 03:26:30,627 INFO L754 eck$LassoCheckResult]: Loop: 25025#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 25490#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 25541#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 25452#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 25536#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 25534#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 25089#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 25489#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 25488#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 25486#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 25485#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 25484#L84 assume !(0 == mp_add_~i~0#1 % 256); 25471#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 25470#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 25106#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 25469#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 25468#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 25467#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 25466#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 25465#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 25086#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 25464#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 25367#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 25366#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 25365#L84 assume !(0 == mp_add_~i~0#1 % 256); 25364#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 25363#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 25362#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 25361#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 25360#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 25358#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 25356#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 25354#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 25352#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 25156#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 25044#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 25045#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 25176#L84 assume !(0 == mp_add_~i~0#1 % 256); 25174#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 25025#L85-1 [2022-07-13 03:26:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1233837692, now seen corresponding path program 1 times [2022-07-13 03:26:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:30,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259982967] [2022-07-13 03:26:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:30,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:30,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259982967] [2022-07-13 03:26:30,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259982967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:30,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:30,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 03:26:30,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191694334] [2022-07-13 03:26:30,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:30,704 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:30,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:30,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1205102556, now seen corresponding path program 2 times [2022-07-13 03:26:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:30,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503794822] [2022-07-13 03:26:30,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:30,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:30,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:30,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503794822] [2022-07-13 03:26:30,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503794822] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:30,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029045712] [2022-07-13 03:26:30,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:26:30,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:30,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:30,763 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) [2022-07-13 03:26:30,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 03:26:30,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 03:26:30,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:30,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:26:30,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 03:26:30,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:26:30,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029045712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:30,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 03:26:30,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-13 03:26:30,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21028386] [2022-07-13 03:26:30,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:30,841 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:30,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:30,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:26:30,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:26:30,841 INFO L87 Difference]: Start difference. First operand 652 states and 863 transitions. cyclomatic complexity: 219 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:31,314 INFO L93 Difference]: Finished difference Result 2515 states and 3342 transitions. [2022-07-13 03:26:31,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 03:26:31,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2515 states and 3342 transitions. [2022-07-13 03:26:31,325 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 2244 [2022-07-13 03:26:31,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2515 states to 2515 states and 3342 transitions. [2022-07-13 03:26:31,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2515 [2022-07-13 03:26:31,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2515 [2022-07-13 03:26:31,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2515 states and 3342 transitions. [2022-07-13 03:26:31,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:31,341 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2515 states and 3342 transitions. [2022-07-13 03:26:31,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states and 3342 transitions. [2022-07-13 03:26:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 634. [2022-07-13 03:26:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 634 states have (on average 1.3296529968454258) internal successors, (843), 633 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 843 transitions. [2022-07-13 03:26:31,362 INFO L392 hiAutomatonCegarLoop]: Abstraction has 634 states and 843 transitions. [2022-07-13 03:26:31,362 INFO L374 stractBuchiCegarLoop]: Abstraction has 634 states and 843 transitions. [2022-07-13 03:26:31,362 INFO L287 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-07-13 03:26:31,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 843 transitions. [2022-07-13 03:26:31,364 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 561 [2022-07-13 03:26:31,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:31,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:31,364 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:31,365 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:31,365 INFO L752 eck$LassoCheckResult]: Stem: 28312#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 28303#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 28290#L59 assume !(0 == mp_add_~a3~0#1 % 256); 28291#L59-1 mp_add_~nb~0#1 := 4; 28308#L69 assume !(0 == mp_add_~b3~0#1 % 256); 28299#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 28315#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28316#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28373#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 28372#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 28371#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 28370#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 28369#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28368#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 28367#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28366#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28365#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28364#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 28363#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 28362#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28361#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28360#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28359#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28357#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28358#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28660#L84 assume !(0 == mp_add_~i~0#1 % 256); 28658#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 28410#L85-1 [2022-07-13 03:26:31,365 INFO L754 eck$LassoCheckResult]: Loop: 28410#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 28656#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 28917#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28651#L90 assume !(0 == mp_add_~i~0#1 % 256); 28649#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 28432#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28647#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28646#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 28645#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28644#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 28421#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28643#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28642#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28640#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28641#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28659#L84 assume !(0 == mp_add_~i~0#1 % 256); 28657#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 28587#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 28408#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 28585#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28579#L90 assume !(0 == mp_add_~i~0#1 % 256); 28575#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28555#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 28429#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28554#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 28553#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28552#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28539#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 28419#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28537#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28516#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28513#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28515#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28565#L90 assume !(0 == mp_add_~i~0#1 % 256); 28564#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28563#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28562#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 28561#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 28497#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28490#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28491#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28485#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 28478#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28479#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28472#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28473#L84 assume !(0 == mp_add_~i~0#1 % 256); 28463#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 28410#L85-1 [2022-07-13 03:26:31,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 1 times [2022-07-13 03:26:31,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780766953] [2022-07-13 03:26:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,378 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1630170944, now seen corresponding path program 1 times [2022-07-13 03:26:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737471619] [2022-07-13 03:26:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:31,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:31,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737471619] [2022-07-13 03:26:31,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737471619] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:31,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194925876] [2022-07-13 03:26:31,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:31,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:31,457 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) [2022-07-13 03:26:31,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 03:26:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:31,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:26:31,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 03:26:31,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:26:31,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194925876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:31,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 03:26:31,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-13 03:26:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317267804] [2022-07-13 03:26:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:31,532 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:31,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:31,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 03:26:31,533 INFO L87 Difference]: Start difference. First operand 634 states and 843 transitions. cyclomatic complexity: 217 Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:31,668 INFO L93 Difference]: Finished difference Result 639 states and 752 transitions. [2022-07-13 03:26:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:26:31,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 639 states and 752 transitions. [2022-07-13 03:26:31,671 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 522 [2022-07-13 03:26:31,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 639 states to 554 states and 638 transitions. [2022-07-13 03:26:31,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 554 [2022-07-13 03:26:31,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 554 [2022-07-13 03:26:31,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 554 states and 638 transitions. [2022-07-13 03:26:31,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:31,674 INFO L369 hiAutomatonCegarLoop]: Abstraction has 554 states and 638 transitions. [2022-07-13 03:26:31,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states and 638 transitions. [2022-07-13 03:26:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 491. [2022-07-13 03:26:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 491 states have (on average 1.1690427698574337) internal successors, (574), 490 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 574 transitions. [2022-07-13 03:26:31,681 INFO L392 hiAutomatonCegarLoop]: Abstraction has 491 states and 574 transitions. [2022-07-13 03:26:31,681 INFO L374 stractBuchiCegarLoop]: Abstraction has 491 states and 574 transitions. [2022-07-13 03:26:31,681 INFO L287 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-07-13 03:26:31,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 491 states and 574 transitions. [2022-07-13 03:26:31,683 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 459 [2022-07-13 03:26:31,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:31,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:31,685 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:31,685 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:31,686 INFO L752 eck$LassoCheckResult]: Stem: 29734#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 29724#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 29712#L59 assume !(0 == mp_add_~a3~0#1 % 256); 29713#L59-1 mp_add_~nb~0#1 := 4; 29729#L69 assume !(0 == mp_add_~b3~0#1 % 256); 29720#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 29746#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29917#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29916#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 29915#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 29914#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 29913#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 29912#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29911#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 29910#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29909#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29908#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29907#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29906#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 29905#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29904#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29903#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29902#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29901#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29899#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29898#L84 assume !(0 == mp_add_~i~0#1 % 256); 29897#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 29805#L85-1 [2022-07-13 03:26:31,686 INFO L754 eck$LassoCheckResult]: Loop: 29805#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 29896#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 29894#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29893#L90 assume !(0 == mp_add_~i~0#1 % 256); 29892#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 29797#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29891#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29890#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29889#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29888#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 29819#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29887#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29886#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29885#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29882#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29881#L84 assume !(0 == mp_add_~i~0#1 % 256); 29880#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 29879#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 29803#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 29875#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29873#L90 assume !(0 == mp_add_~i~0#1 % 256); 29871#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29868#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 29795#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29864#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29862#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29860#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29857#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 29816#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29855#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29852#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29853#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29884#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29963#L90 assume !(0 == mp_add_~i~0#1 % 256); 29962#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29961#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29960#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 29867#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29959#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29954#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29953#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29942#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 29941#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29939#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29936#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29833#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29933#L90 assume !(0 == mp_add_~i~0#1 % 256); 29931#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29928#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29925#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29923#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29922#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29920#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29921#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29870#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29856#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29854#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29850#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29851#L84 assume !(0 == mp_add_~i~0#1 % 256); 29846#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 29805#L85-1 [2022-07-13 03:26:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 2 times [2022-07-13 03:26:31,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980096722] [2022-07-13 03:26:31,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,702 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1536835773, now seen corresponding path program 2 times [2022-07-13 03:26:31,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145210337] [2022-07-13 03:26:31,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:31,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:31,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145210337] [2022-07-13 03:26:31,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145210337] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:31,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30830942] [2022-07-13 03:26:31,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:26:31,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:31,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:31,812 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) [2022-07-13 03:26:31,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 03:26:31,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 03:26:31,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:31,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 03:26:31,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 03:26:32,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:26:32,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30830942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:32,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 03:26:32,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2022-07-13 03:26:32,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502650157] [2022-07-13 03:26:32,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:32,186 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:32,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:32,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 03:26:32,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-13 03:26:32,186 INFO L87 Difference]: Start difference. First operand 491 states and 574 transitions. cyclomatic complexity: 90 Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:32,466 INFO L93 Difference]: Finished difference Result 429 states and 450 transitions. [2022-07-13 03:26:32,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 03:26:32,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 429 states and 450 transitions. [2022-07-13 03:26:32,469 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 108 [2022-07-13 03:26:32,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 429 states to 417 states and 432 transitions. [2022-07-13 03:26:32,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 417 [2022-07-13 03:26:32,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 417 [2022-07-13 03:26:32,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 417 states and 432 transitions. [2022-07-13 03:26:32,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:32,471 INFO L369 hiAutomatonCegarLoop]: Abstraction has 417 states and 432 transitions. [2022-07-13 03:26:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 432 transitions. [2022-07-13 03:26:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 212. [2022-07-13 03:26:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 212 states have (on average 1.0566037735849056) internal successors, (224), 211 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) [2022-07-13 03:26:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 224 transitions. [2022-07-13 03:26:32,476 INFO L392 hiAutomatonCegarLoop]: Abstraction has 212 states and 224 transitions. [2022-07-13 03:26:32,476 INFO L374 stractBuchiCegarLoop]: Abstraction has 212 states and 224 transitions. [2022-07-13 03:26:32,476 INFO L287 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-07-13 03:26:32,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 224 transitions. [2022-07-13 03:26:32,477 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 60 [2022-07-13 03:26:32,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:32,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:32,478 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 03:26:32,478 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:32,478 INFO L752 eck$LassoCheckResult]: Stem: 30847#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 30840#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 30833#L59 assume !(0 == mp_add_~a3~0#1 % 256); 30834#L59-1 mp_add_~nb~0#1 := 4; 30843#L69 assume !(0 == mp_add_~b3~0#1 % 256); 30838#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 30858#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30911#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 30910#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 30909#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 30908#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 30907#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 30906#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 30905#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 30904#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 30903#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 30902#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 30901#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 30900#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 30899#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 30898#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 30897#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 30896#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 30895#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30893#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 30892#L84 assume !(0 == mp_add_~i~0#1 % 256); 30891#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 30890#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 30888#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 30885#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 30881#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 30882#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 30877#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 30878#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 30873#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 30874#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 30869#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30870#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 30864#L84 assume !(0 == mp_add_~i~0#1 % 256); 30865#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 30860#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 30861#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 30932#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 30929#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 30928#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 30927#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 30926#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 30925#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 30924#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 30923#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30922#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 30921#L84 assume !(0 == mp_add_~i~0#1 % 256); 30920#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 30919#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 30917#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 30918#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 30992#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 31039#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31038#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31037#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 30852#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 30853#L102-1 [2022-07-13 03:26:32,478 INFO L754 eck$LassoCheckResult]: Loop: 30853#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 30913#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30912#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 30845#L84 assume !(0 == mp_add_~i~0#1 % 256); 30846#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 30850#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 30851#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 30859#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 30828#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 30829#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 30844#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 30835#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 30836#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 30853#L102-1 [2022-07-13 03:26:32,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:32,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1922539841, now seen corresponding path program 1 times [2022-07-13 03:26:32,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:32,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406743712] [2022-07-13 03:26:32,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:32,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 03:26:32,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:32,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406743712] [2022-07-13 03:26:32,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406743712] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:32,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69680937] [2022-07-13 03:26:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:32,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:32,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:32,571 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:32,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 03:26:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:32,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:26:32,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 03:26:32,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 03:26:32,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69680937] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:32,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:32,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-07-13 03:26:32,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226957869] [2022-07-13 03:26:32,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:32,956 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1466073576, now seen corresponding path program 1 times [2022-07-13 03:26:32,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:32,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577530238] [2022-07-13 03:26:32,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:32,961 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:32,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:33,056 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:33,056 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:33,056 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:33,057 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:33,057 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:26:33,057 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:33,057 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:33,057 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:33,057 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration22_Loop [2022-07-13 03:26:33,057 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:33,058 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:33,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:33,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:33,260 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:33,261 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:26:33,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:33,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:33,264 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:33,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 03:26:33,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:33,266 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:33,284 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:26:33,284 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:26:33,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-13 03:26:33,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:33,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:33,309 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:33,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 03:26:33,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:33,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:33,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-13 03:26:33,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:33,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:33,369 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:33,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-13 03:26:33,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:26:33,372 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:33,967 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:26:33,974 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 [2022-07-13 03:26:33,975 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:33,975 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:33,975 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:33,975 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:33,975 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:26:33,975 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:33,975 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:33,975 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:33,975 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration22_Loop [2022-07-13 03:26:33,975 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:33,975 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:33,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:33,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:34,209 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:34,213 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:26:34,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,216 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,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 [2022-07-13 03:26:34,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:34,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:34,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:34,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:34,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-13 03:26:34,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:34,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:34,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,276 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-13 03:26:34,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:34,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:34,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:34,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:34,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:34,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:34,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-13 03:26:34,310 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-13 03:26:34,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,311 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-13 03:26:34,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:34,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:34,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,319 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:34,321 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:34,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:34,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:34,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:34,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,344 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-13 03:26:34,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:34,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:34,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,352 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:34,356 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:34,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:34,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:34,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:34,408 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-13 03:26:34,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,410 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:34,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:34,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,432 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:34,436 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:34,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:34,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-13 03:26:34,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:34,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:34,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,484 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-13 03:26:34,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:34,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:34,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,494 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:34,499 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:34,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:34,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:34,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:34,537 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-13 03:26:34,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,539 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-13 03:26:34,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:34,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:34,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,551 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:34,554 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:34,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:34,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:34,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:34,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,598 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-13 03:26:34,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 [2022-07-13 03:26:34,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:34,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,608 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:34,614 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:34,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:34,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:34,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:34,656 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-13 03:26:34,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,658 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,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 [2022-07-13 03:26:34,675 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:34,675 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:34,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,676 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:34,678 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:34,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:34,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-13 03:26:34,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:34,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:34,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,721 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-13 03:26:34,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:34,730 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:34,731 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:34,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,731 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:34,736 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:34,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:34,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:34,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:34,782 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-13 03:26:34,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,793 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:34,811 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:34,811 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:34,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,811 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:34,816 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:34,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:34,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-13 03:26:34,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:34,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:34,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,859 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-13 03:26:34,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:34,868 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:34,869 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:34,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,869 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:34,876 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:34,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:34,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:34,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:34,919 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-13 03:26:34,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,920 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:34,931 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:34,931 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:34,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,932 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:34,936 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:34,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:34,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-13 03:26:34,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:34,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:34,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:34,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:34,983 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:34,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:34,996 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:34,996 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:34,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:34,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:34,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:34,996 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:35,005 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:35,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:35,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-13 03:26:35,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:35,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:35,051 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-13 03:26:35,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:35,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:35,052 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:35,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:35,063 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:35,063 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:35,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:35,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:35,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:35,064 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:35,067 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:35,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:35,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-13 03:26:35,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:35,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:35,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:35,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:35,109 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:35,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:35,119 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:35,119 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:35,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:35,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:35,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:35,120 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:35,125 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:35,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:35,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:35,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-13 03:26:35,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:35,176 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-13 03:26:35,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:35,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:35,180 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:35,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-13 03:26:35,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:35,190 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:35,190 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:35,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:35,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:35,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:35,190 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:35,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:35,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:35,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:35,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:35,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:35,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:35,242 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:35,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-13 03:26:35,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:35,253 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:35,253 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:35,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:35,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:35,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:35,253 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:35,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:35,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:35,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:35,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:35,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 03:26:35,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2022-07-13 03:26:35,312 INFO L87 Difference]: Start difference. First operand 212 states and 224 transitions. cyclomatic complexity: 16 Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:35,629 INFO L93 Difference]: Finished difference Result 442 states and 461 transitions. [2022-07-13 03:26:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 03:26:35,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 442 states and 461 transitions. [2022-07-13 03:26:35,632 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 132 [2022-07-13 03:26:35,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 442 states to 442 states and 461 transitions. [2022-07-13 03:26:35,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 442 [2022-07-13 03:26:35,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 442 [2022-07-13 03:26:35,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 442 states and 461 transitions. [2022-07-13 03:26:35,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:35,634 INFO L369 hiAutomatonCegarLoop]: Abstraction has 442 states and 461 transitions. [2022-07-13 03:26:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 461 transitions. [2022-07-13 03:26:35,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 296. [2022-07-13 03:26:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 296 states have (on average 1.054054054054054) internal successors, (312), 295 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 312 transitions. [2022-07-13 03:26:35,639 INFO L392 hiAutomatonCegarLoop]: Abstraction has 296 states and 312 transitions. [2022-07-13 03:26:35,639 INFO L374 stractBuchiCegarLoop]: Abstraction has 296 states and 312 transitions. [2022-07-13 03:26:35,640 INFO L287 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-07-13 03:26:35,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 312 transitions. [2022-07-13 03:26:35,641 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 60 [2022-07-13 03:26:35,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:35,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:35,641 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 03:26:35,642 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:35,642 INFO L752 eck$LassoCheckResult]: Stem: 31884#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 31876#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 31869#L59 assume !(0 == mp_add_~a3~0#1 % 256); 31870#L59-1 mp_add_~nb~0#1 := 4; 31879#L69 assume !(0 == mp_add_~b3~0#1 % 256); 31881#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 32001#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32002#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 31997#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 31998#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 31993#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 31994#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 31989#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31990#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 31985#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31986#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31981#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31982#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 31977#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 31978#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31973#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31974#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31969#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31970#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31965#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31931#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 32056#L90 assume !(0 == mp_add_~i~0#1 % 256); 32054#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 32052#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 32050#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 32048#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32046#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32044#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 32043#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32042#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32041#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32040#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32031#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 32030#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 32029#L90 assume !(0 == mp_add_~i~0#1 % 256); 32028#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 32027#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 32026#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 32025#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32024#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32023#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32022#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 32021#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32020#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32019#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32018#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 32017#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 32016#L90 assume !(0 == mp_add_~i~0#1 % 256); 32015#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 32014#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 32013#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 32012#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32011#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32010#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32009#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32008#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 32006#L102-1 [2022-07-13 03:26:35,642 INFO L754 eck$LassoCheckResult]: Loop: 32006#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31886#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31887#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31893#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 32058#L90 assume !(0 == mp_add_~i~0#1 % 256); 32057#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 32055#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 32053#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 32051#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32049#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32047#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32045#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32007#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32006#L102-1 [2022-07-13 03:26:35,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:35,642 INFO L85 PathProgramCache]: Analyzing trace with hash -70625049, now seen corresponding path program 1 times [2022-07-13 03:26:35,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:35,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540253549] [2022-07-13 03:26:35,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:35,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 03:26:35,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:35,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540253549] [2022-07-13 03:26:35,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540253549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:35,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984571257] [2022-07-13 03:26:35,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:35,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:35,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:35,732 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:35,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-13 03:26:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:35,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:26:35,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 03:26:35,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 03:26:36,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984571257] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:36,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:36,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-07-13 03:26:36,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987020843] [2022-07-13 03:26:36,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:36,032 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:36,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:36,032 INFO L85 PathProgramCache]: Analyzing trace with hash 922833652, now seen corresponding path program 1 times [2022-07-13 03:26:36,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:36,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183195316] [2022-07-13 03:26:36,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:36,036 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:36,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:36,123 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:36,123 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:36,123 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:36,123 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:36,124 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:26:36,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:36,124 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:36,124 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:36,124 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration23_Loop [2022-07-13 03:26:36,124 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:36,124 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:36,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:36,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:36,356 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:36,356 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:26:36,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:36,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:36,360 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:36,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-13 03:26:36,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:36,364 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:36,396 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:26:36,396 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:26:36,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:36,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:36,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:36,424 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:36,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-13 03:26:36,427 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:36,427 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:36,465 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 [2022-07-13 03:26:36,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:36,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:36,467 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:36,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-13 03:26:36,471 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:26:36,471 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:37,125 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:26:37,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-13 03:26:37,130 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:37,130 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:37,130 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:37,130 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:37,130 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:26:37,130 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,130 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:37,130 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:37,130 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration23_Loop [2022-07-13 03:26:37,130 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:37,130 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:37,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:37,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:37,320 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:37,321 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:26:37,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,322 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-13 03:26:37,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 [2022-07-13 03:26:37,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:37,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:37,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:37,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,347 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 [2022-07-13 03:26:37,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,349 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-13 03:26:37,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:37,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:37,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:37,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:37,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-13 03:26:37,391 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-13 03:26:37,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,392 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-13 03:26:37,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 [2022-07-13 03:26:37,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:37,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,403 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:37,404 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:37,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-13 03:26:37,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,422 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-13 03:26:37,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:37,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:37,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,430 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:37,433 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:37,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-13 03:26:37,452 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-13 03:26:37,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,453 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-13 03:26:37,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:37,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:37,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,461 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:37,463 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:37,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-13 03:26:37,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,482 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-13 03:26:37,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:37,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:37,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,489 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:37,494 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:37,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,525 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 [2022-07-13 03:26:37,526 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-13 03:26:37,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,527 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-13 03:26:37,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:37,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:37,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,535 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:37,537 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:37,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-13 03:26:37,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,557 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-13 03:26:37,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:37,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:37,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,565 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:37,570 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:37,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-13 03:26:37,591 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-13 03:26:37,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,593 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-13 03:26:37,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:37,600 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:37,600 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:37,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,600 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:37,602 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:37,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:37,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,654 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:37,666 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:37,667 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:37,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,667 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:37,671 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:37,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-13 03:26:37,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,707 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 [2022-07-13 03:26:37,708 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-13 03:26:37,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,710 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-13 03:26:37,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:37,719 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:37,719 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:37,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,720 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:37,722 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:37,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:37,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,763 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:37,775 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:37,775 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:37,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,776 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:37,782 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:37,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-13 03:26:37,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:37,830 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-13 03:26:37,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,831 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:37,844 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:37,844 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:37,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,844 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:37,856 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:37,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-13 03:26:37,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:37,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,892 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-13 03:26:37,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:37,901 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:37,901 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:37,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,901 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:37,908 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:37,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:37,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:37,956 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-13 03:26:37,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:37,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:37,959 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:37,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:37,970 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:37,970 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:37,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:37,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:37,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:37,971 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:37,973 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:37,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:37,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-13 03:26:37,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:38,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:38,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:38,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:38,015 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:38,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:38,027 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:38,027 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:38,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:38,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:38,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:38,028 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:38,033 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:38,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:38,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-13 03:26:38,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:38,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:38,083 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-13 03:26:38,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:38,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:38,084 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:38,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:38,098 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:38,098 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:38,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:38,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:38,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:38,099 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:38,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:38,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:38,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-13 03:26:38,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:38,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:38,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:38,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:38,148 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:38,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-13 03:26:38,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:38,157 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:38,158 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:38,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:38,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:38,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:38,158 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:38,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:38,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:38,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:38,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:38,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:38,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 03:26:38,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-13 03:26:38,211 INFO L87 Difference]: Start difference. First operand 296 states and 312 transitions. cyclomatic complexity: 20 Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:38,407 INFO L93 Difference]: Finished difference Result 257 states and 268 transitions. [2022-07-13 03:26:38,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 03:26:38,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 268 transitions. [2022-07-13 03:26:38,409 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2022-07-13 03:26:38,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 248 states and 257 transitions. [2022-07-13 03:26:38,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2022-07-13 03:26:38,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2022-07-13 03:26:38,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 257 transitions. [2022-07-13 03:26:38,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:38,411 INFO L369 hiAutomatonCegarLoop]: Abstraction has 248 states and 257 transitions. [2022-07-13 03:26:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 257 transitions. [2022-07-13 03:26:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 237. [2022-07-13 03:26:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 237 states have (on average 1.0379746835443038) internal successors, (246), 236 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 246 transitions. [2022-07-13 03:26:38,414 INFO L392 hiAutomatonCegarLoop]: Abstraction has 237 states and 246 transitions. [2022-07-13 03:26:38,414 INFO L374 stractBuchiCegarLoop]: Abstraction has 237 states and 246 transitions. [2022-07-13 03:26:38,414 INFO L287 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-07-13 03:26:38,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 237 states and 246 transitions. [2022-07-13 03:26:38,415 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2022-07-13 03:26:38,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:38,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:38,416 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 03:26:38,416 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:38,416 INFO L752 eck$LassoCheckResult]: Stem: 32819#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 32811#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 32804#L59 assume !(0 == mp_add_~a3~0#1 % 256); 32805#L59-1 mp_add_~nb~0#1 := 4; 32814#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 32808#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 32810#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 32830#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 32940#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32939#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32938#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 32937#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 32936#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 32935#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 32934#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 32933#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 32932#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 32931#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 32930#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 32929#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32928#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 32927#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32926#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32925#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32924#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32923#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32922#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32921#L84 assume !(0 == mp_add_~i~0#1 % 256); 32920#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 32919#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 32918#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 32916#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32915#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32914#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32913#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 32912#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32911#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32910#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32909#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32908#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32907#L84 assume !(0 == mp_add_~i~0#1 % 256); 32906#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 32904#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 32812#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 32813#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32832#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33015#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33014#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33013#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 32960#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32959#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32957#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32956#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32954#L84 assume !(0 == mp_add_~i~0#1 % 256); 32953#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 32951#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 32950#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 32947#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32946#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32945#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32944#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32943#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32942#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 32827#L102-1 [2022-07-13 03:26:38,416 INFO L754 eck$LassoCheckResult]: Loop: 32827#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32820#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32821#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32817#L84 assume !(0 == mp_add_~i~0#1 % 256); 32818#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 32828#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 32905#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 32968#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32966#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32964#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32963#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32962#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32941#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32827#L102-1 [2022-07-13 03:26:38,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:38,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1569068628, now seen corresponding path program 1 times [2022-07-13 03:26:38,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:38,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763287529] [2022-07-13 03:26:38,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:38,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:38,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:38,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:38,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1466073576, now seen corresponding path program 2 times [2022-07-13 03:26:38,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:38,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421327618] [2022-07-13 03:26:38,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:38,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:38,464 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:38,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:38,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1058244261, now seen corresponding path program 2 times [2022-07-13 03:26:38,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:38,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563998648] [2022-07-13 03:26:38,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:38,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 40 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:38,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:38,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563998648] [2022-07-13 03:26:38,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563998648] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:38,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689784313] [2022-07-13 03:26:38,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:26:38,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:38,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:38,588 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:38,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-07-13 03:26:38,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 03:26:38,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:38,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:26:38,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 03:26:38,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 03:26:39,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689784313] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:39,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:39,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2022-07-13 03:26:39,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007952328] [2022-07-13 03:26:39,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:39,244 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:39,244 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:39,245 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:39,245 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:39,245 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:26:39,245 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:39,245 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:39,245 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:39,245 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration24_Loop [2022-07-13 03:26:39,245 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:39,245 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:39,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:39,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:39,469 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:39,469 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:26:39,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:39,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:39,471 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:39,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-13 03:26:39,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:39,475 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:39,487 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:26:39,487 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:26:39,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-13 03:26:39,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:39,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:39,504 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:39,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-13 03:26:39,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:39,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:39,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-13 03:26:39,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:39,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:39,555 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:39,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-13 03:26:39,558 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:26:39,558 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:40,639 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:26:40,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-13 03:26:40,643 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:40,644 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:40,644 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:40,644 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:40,644 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:26:40,644 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:40,644 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:40,644 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:40,644 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration24_Loop [2022-07-13 03:26:40,644 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:40,644 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:40,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:40,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:40,831 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:40,831 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:26:40,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:40,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:40,832 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:40,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-13 03:26:40,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:40,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:40,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:40,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:40,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:40,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:40,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:40,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:40,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:40,858 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 [2022-07-13 03:26:40,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:40,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:40,860 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:40,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-13 03:26:40,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:40,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:40,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:40,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:40,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:40,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:40,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:40,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:40,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:40,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-13 03:26:40,887 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-13 03:26:40,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:40,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:40,888 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) [2022-07-13 03:26:40,889 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 [2022-07-13 03:26:40,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 [2022-07-13 03:26:40,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:40,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:40,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:40,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:40,897 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:40,898 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:40,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:40,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:40,916 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 [2022-07-13 03:26:40,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:40,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:40,917 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) [2022-07-13 03:26:40,918 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 [2022-07-13 03:26:40,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:40,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:40,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:40,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:40,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:40,926 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:40,928 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:40,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:40,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:40,946 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 [2022-07-13 03:26:40,947 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-13 03:26:40,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:40,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:40,948 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) [2022-07-13 03:26:40,948 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 [2022-07-13 03:26:40,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:40,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:40,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:40,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:40,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:40,956 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:40,958 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:40,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:40,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:40,976 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 [2022-07-13 03:26:40,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:40,977 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) [2022-07-13 03:26:40,978 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 [2022-07-13 03:26:40,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:40,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:40,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:40,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:40,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:40,985 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:40,988 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:40,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:40,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:41,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-07-13 03:26:41,008 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-13 03:26:41,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:41,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:41,009 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) [2022-07-13 03:26:41,009 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 [2022-07-13 03:26:41,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:41,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:41,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:41,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:41,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:41,018 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:41,020 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:41,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:41,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:41,040 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 [2022-07-13 03:26:41,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:41,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:41,041 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) [2022-07-13 03:26:41,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:41,047 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 [2022-07-13 03:26:41,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:41,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:41,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:41,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:41,052 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:41,056 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:41,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:41,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:41,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-13 03:26:41,077 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-13 03:26:41,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:41,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:41,078 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) [2022-07-13 03:26:41,078 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 [2022-07-13 03:26:41,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:41,085 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:41,085 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:41,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:41,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:41,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:41,086 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:41,087 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:41,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:41,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:41,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-13 03:26:41,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:41,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:41,107 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) [2022-07-13 03:26:41,107 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 [2022-07-13 03:26:41,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:41,114 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:41,114 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:41,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:41,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:41,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:41,115 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:41,118 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:41,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:41,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:41,165 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 [2022-07-13 03:26:41,166 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-13 03:26:41,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:41,167 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) [2022-07-13 03:26:41,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:41,178 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:41,178 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:41,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:41,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:41,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:41,178 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:41,181 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:41,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:41,187 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 [2022-07-13 03:26:41,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:41,217 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 [2022-07-13 03:26:41,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:41,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:41,219 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) [2022-07-13 03:26:41,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:41,230 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:41,231 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:41,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:41,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:41,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:41,231 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:41,236 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:41,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:41,247 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 [2022-07-13 03:26:41,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:41,274 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 [2022-07-13 03:26:41,274 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-13 03:26:41,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:41,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:41,276 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) [2022-07-13 03:26:41,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:41,286 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:41,287 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:41,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:41,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:41,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:41,287 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:41,290 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:41,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:41,299 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 [2022-07-13 03:26:41,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:41,329 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 [2022-07-13 03:26:41,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:41,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:41,331 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) [2022-07-13 03:26:41,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:41,343 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:41,343 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:41,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:41,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:41,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:41,343 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:41,350 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:41,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:41,361 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 [2022-07-13 03:26:41,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:41,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:41,389 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-13 03:26:41,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:41,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:41,391 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) [2022-07-13 03:26:41,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:41,402 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:41,402 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:41,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:41,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:41,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:41,402 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:41,404 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:41,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:41,409 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 [2022-07-13 03:26:41,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:41,438 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 [2022-07-13 03:26:41,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:41,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:41,440 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:41,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:41,450 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:41,450 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:41,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:41,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:41,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:41,450 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:41,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-13 03:26:41,454 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:41,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:41,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:41,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-13 03:26:41,496 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-13 03:26:41,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:41,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:41,497 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) [2022-07-13 03:26:41,498 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 [2022-07-13 03:26:41,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 [2022-07-13 03:26:41,505 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:41,505 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:41,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:41,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:41,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:41,505 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:41,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:41,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:41,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:41,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-13 03:26:41,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:41,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:41,530 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) [2022-07-13 03:26:41,530 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 [2022-07-13 03:26:41,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:41,537 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:41,537 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:41,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:41,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:41,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:41,538 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:41,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:41,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:41,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:41,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:41,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:41,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 03:26:41,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-13 03:26:41,580 INFO L87 Difference]: Start difference. First operand 237 states and 246 transitions. cyclomatic complexity: 12 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) [2022-07-13 03:26:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:42,190 INFO L93 Difference]: Finished difference Result 236 states and 241 transitions. [2022-07-13 03:26:42,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 03:26:42,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 236 states and 241 transitions. [2022-07-13 03:26:42,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-13 03:26:42,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 236 states to 202 states and 205 transitions. [2022-07-13 03:26:42,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 202 [2022-07-13 03:26:42,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 202 [2022-07-13 03:26:42,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 205 transitions. [2022-07-13 03:26:42,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:42,194 INFO L369 hiAutomatonCegarLoop]: Abstraction has 202 states and 205 transitions. [2022-07-13 03:26:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 205 transitions. [2022-07-13 03:26:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 88. [2022-07-13 03:26:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 87 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2022-07-13 03:26:42,195 INFO L392 hiAutomatonCegarLoop]: Abstraction has 88 states and 91 transitions. [2022-07-13 03:26:42,195 INFO L374 stractBuchiCegarLoop]: Abstraction has 88 states and 91 transitions. [2022-07-13 03:26:42,195 INFO L287 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2022-07-13 03:26:42,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 91 transitions. [2022-07-13 03:26:42,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-13 03:26:42,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:42,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:42,196 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 03:26:42,196 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:42,197 INFO L752 eck$LassoCheckResult]: Stem: 33778#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 33771#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 33760#L59 assume !(0 == mp_add_~a3~0#1 % 256); 33761#L59-1 mp_add_~nb~0#1 := 4; 33774#L69 assume !(0 == mp_add_~b3~0#1 % 256); 33767#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 33787#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33839#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33776#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 33777#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33824#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33823#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 33822#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33821#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 33820#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 33819#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 33818#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33817#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33816#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 33815#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33814#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33813#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33812#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33811#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33810#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33809#L84 assume !(0 == mp_add_~i~0#1 % 256); 33808#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 33807#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33806#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 33805#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33804#L90 assume !(0 == mp_add_~i~0#1 % 256); 33803#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 33802#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 33801#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33800#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33799#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33798#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 33797#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33796#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33795#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33794#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33793#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33792#L84 assume !(0 == mp_add_~i~0#1 % 256); 33791#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33789#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 33790#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 33838#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33837#L90 assume !(0 == mp_add_~i~0#1 % 256); 33836#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 33835#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 33834#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33833#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33832#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33831#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33830#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 33829#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33828#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33827#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33826#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33825#L84 assume !(0 == mp_add_~i~0#1 % 256); 33788#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33781#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33772#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 33773#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33847#L90 assume !(0 == mp_add_~i~0#1 % 256); 33846#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 33845#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 33844#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 33843#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33842#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33841#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33840#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33782#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 33783#L102-1 [2022-07-13 03:26:42,197 INFO L754 eck$LassoCheckResult]: Loop: 33783#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33779#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33780#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 33786#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33784#L90 assume !(0 == mp_add_~i~0#1 % 256); 33785#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 33762#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 33763#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33764#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33765#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33775#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33769#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33770#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33783#L102-1 [2022-07-13 03:26:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash -740058285, now seen corresponding path program 1 times [2022-07-13 03:26:42,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:42,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573789732] [2022-07-13 03:26:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:42,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:42,237 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:42,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash 922833652, now seen corresponding path program 2 times [2022-07-13 03:26:42,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:42,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125371858] [2022-07-13 03:26:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:42,264 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:42,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:42,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:42,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1373885214, now seen corresponding path program 1 times [2022-07-13 03:26:42,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:42,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39249308] [2022-07-13 03:26:42,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:42,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 36 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:42,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:42,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39249308] [2022-07-13 03:26:42,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39249308] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:42,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408977783] [2022-07-13 03:26:42,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:42,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:42,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:42,380 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:42,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-07-13 03:26:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:42,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:26:42,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 92 proven. 1 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 03:26:42,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 36 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 03:26:42,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408977783] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:42,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:42,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2022-07-13 03:26:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945992365] [2022-07-13 03:26:42,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:43,045 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:43,045 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:43,045 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:43,045 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:43,045 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:26:43,045 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:43,045 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:43,045 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:43,045 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration25_Loop [2022-07-13 03:26:43,045 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:43,045 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:43,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:43,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:43,265 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:43,265 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:26:43,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:43,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:43,271 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) [2022-07-13 03:26:43,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:43,276 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:43,279 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 [2022-07-13 03:26:43,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:43,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:43,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:43,369 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) [2022-07-13 03:26:43,370 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 [2022-07-13 03:26:43,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:26:43,372 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:44,332 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:26:44,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:44,336 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:44,336 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:44,336 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:44,336 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:44,336 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:26:44,336 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,336 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:44,336 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:44,336 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration25_Loop [2022-07-13 03:26:44,336 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:44,336 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:44,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:44,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:44,534 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:44,534 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:26:44,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:44,536 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) [2022-07-13 03:26:44,537 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 [2022-07-13 03:26:44,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:44,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:44,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:44,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:44,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:44,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:44,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:44,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:44,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:44,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:44,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:44,564 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) [2022-07-13 03:26:44,565 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 [2022-07-13 03:26:44,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:44,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:44,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:44,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:44,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:44,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:44,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:44,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:44,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:44,599 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 [2022-07-13 03:26:44,599 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-13 03:26:44,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:44,601 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) [2022-07-13 03:26:44,601 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 [2022-07-13 03:26:44,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:44,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:44,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:44,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:44,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:44,608 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:44,609 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:44,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:44,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:44,626 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 [2022-07-13 03:26:44,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:44,628 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) [2022-07-13 03:26:44,629 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 [2022-07-13 03:26:44,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:44,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:44,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:44,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:44,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:44,636 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:44,639 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:44,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:44,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:44,657 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 [2022-07-13 03:26:44,658 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-13 03:26:44,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:44,659 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) [2022-07-13 03:26:44,660 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 [2022-07-13 03:26:44,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:44,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:44,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:44,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:44,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:44,667 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:44,669 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:44,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:44,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:44,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:44,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:44,688 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) [2022-07-13 03:26:44,689 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 [2022-07-13 03:26:44,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:44,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:44,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:44,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:44,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:44,696 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:44,700 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:44,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:44,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:44,726 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 [2022-07-13 03:26:44,726 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-13 03:26:44,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:44,728 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) [2022-07-13 03:26:44,728 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 [2022-07-13 03:26:44,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:44,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:44,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:44,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:44,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:44,735 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:44,737 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:44,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:44,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:44,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:44,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:44,760 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) [2022-07-13 03:26:44,761 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 [2022-07-13 03:26:44,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:44,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:44,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:44,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:44,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:44,773 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:44,781 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:44,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:44,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:44,801 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 [2022-07-13 03:26:44,801 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-13 03:26:44,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:44,807 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) [2022-07-13 03:26:44,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:44,811 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 [2022-07-13 03:26:44,814 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:44,814 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:44,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:44,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:44,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:44,814 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:44,816 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:44,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:44,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:44,834 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 [2022-07-13 03:26:44,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:44,836 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) [2022-07-13 03:26:44,836 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 [2022-07-13 03:26:44,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:44,843 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:44,843 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:44,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:44,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:44,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:44,843 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:44,846 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:44,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:44,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:44,866 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 [2022-07-13 03:26:44,867 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-13 03:26:44,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:44,868 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) [2022-07-13 03:26:44,868 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 [2022-07-13 03:26:44,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:44,875 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:44,875 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:44,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:44,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:44,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:44,876 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:44,878 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:44,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:44,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:44,924 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 [2022-07-13 03:26:44,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:44,926 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) [2022-07-13 03:26:44,928 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 [2022-07-13 03:26:44,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:44,935 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:44,936 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:44,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:44,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:44,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:44,936 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:44,941 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:44,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:44,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:44,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:44,980 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-13 03:26:44,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:44,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:44,982 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) [2022-07-13 03:26:44,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:44,994 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:44,994 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:44,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:44,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:44,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:44,994 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:44,998 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:44,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:45,007 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 [2022-07-13 03:26:45,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:45,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:45,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:45,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:45,033 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) [2022-07-13 03:26:45,034 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 [2022-07-13 03:26:45,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:45,041 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:45,041 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:45,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:45,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:45,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:45,041 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:45,055 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:45,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:45,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:45,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-07-13 03:26:45,095 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-13 03:26:45,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:45,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:45,096 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) [2022-07-13 03:26:45,096 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 [2022-07-13 03:26:45,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:45,103 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:45,103 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:45,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:45,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:45,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:45,104 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:45,105 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:45,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:45,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:45,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:45,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:45,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:45,125 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:45,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-07-13 03:26:45,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:45,132 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:45,132 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:45,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:45,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:45,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:45,133 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:45,136 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:45,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:45,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:45,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2022-07-13 03:26:45,156 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-13 03:26:45,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:45,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:45,157 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) [2022-07-13 03:26:45,158 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 [2022-07-13 03:26:45,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 [2022-07-13 03:26:45,165 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:45,165 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:45,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:45,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:45,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:45,165 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:45,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:45,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:45,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:45,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-07-13 03:26:45,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:45,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:45,190 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) [2022-07-13 03:26:45,190 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 [2022-07-13 03:26:45,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:45,197 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:45,198 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:45,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:45,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:45,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:45,198 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:45,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:45,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:45,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:45,226 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 [2022-07-13 03:26:45,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:45,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 03:26:45,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-13 03:26:45,227 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:46,346 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2022-07-13 03:26:46,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 03:26:46,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 233 states and 234 transitions. [2022-07-13 03:26:46,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-13 03:26:46,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 233 states to 89 states and 90 transitions. [2022-07-13 03:26:46,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2022-07-13 03:26:46,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2022-07-13 03:26:46,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 90 transitions. [2022-07-13 03:26:46,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:46,349 INFO L369 hiAutomatonCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-07-13 03:26:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 90 transitions. [2022-07-13 03:26:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-07-13 03:26:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 87 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-07-13 03:26:46,351 INFO L392 hiAutomatonCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-13 03:26:46,351 INFO L374 stractBuchiCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-13 03:26:46,351 INFO L287 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2022-07-13 03:26:46,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 89 transitions. [2022-07-13 03:26:46,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-13 03:26:46,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:46,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:46,352 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 03:26:46,352 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:46,353 INFO L752 eck$LassoCheckResult]: Stem: 34666#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 34659#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 34653#L59 assume !(0 == mp_add_~a3~0#1 % 256); 34654#L59-1 mp_add_~nb~0#1 := 4; 34662#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 34657#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 34658#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 34676#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 34677#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34716#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34664#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 34665#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34713#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34712#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34711#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34710#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 34709#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34708#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34707#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34706#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34705#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 34704#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34703#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34702#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34701#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34700#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34699#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34698#L84 assume !(0 == mp_add_~i~0#1 % 256); 34697#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 34696#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34695#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34694#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34693#L90 assume !(0 == mp_add_~i~0#1 % 256); 34692#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 34691#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34690#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34689#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34688#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34687#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 34686#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34685#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34684#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34683#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34682#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34681#L84 assume !(0 == mp_add_~i~0#1 % 256); 34680#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34678#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 34679#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34728#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34727#L90 assume !(0 == mp_add_~i~0#1 % 256); 34726#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34725#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 34724#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34723#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34722#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34721#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34720#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 34719#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34718#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34717#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34715#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34714#L84 assume !(0 == mp_add_~i~0#1 % 256); 34675#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34669#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34660#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 34661#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34733#L90 assume !(0 == mp_add_~i~0#1 % 256); 34732#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34731#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34729#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 34730#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34736#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34735#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34734#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34670#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 34671#L102-1 [2022-07-13 03:26:46,353 INFO L754 eck$LassoCheckResult]: Loop: 34671#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34667#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34668#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 34674#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34672#L90 assume !(0 == mp_add_~i~0#1 % 256); 34673#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34649#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34650#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34651#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34652#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34663#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34655#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34656#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34671#L102-1 [2022-07-13 03:26:46,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash -597058712, now seen corresponding path program 1 times [2022-07-13 03:26:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:46,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322676674] [2022-07-13 03:26:46,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:46,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 27 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 03:26:46,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:46,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322676674] [2022-07-13 03:26:46,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322676674] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:46,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856725360] [2022-07-13 03:26:46,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:46,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:46,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:46,572 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:46,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-07-13 03:26:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:46,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 03:26:46,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-13 03:26:47,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:26:47,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856725360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:47,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 03:26:47,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 15 [2022-07-13 03:26:47,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436638503] [2022-07-13 03:26:47,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:47,134 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:47,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:47,135 INFO L85 PathProgramCache]: Analyzing trace with hash 922833652, now seen corresponding path program 3 times [2022-07-13 03:26:47,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:47,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631534897] [2022-07-13 03:26:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:47,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:47,140 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:47,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:47,227 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:47,228 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:47,228 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:47,228 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:47,228 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:26:47,228 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:47,228 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:47,228 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:47,228 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration26_Loop [2022-07-13 03:26:47,228 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:47,228 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:47,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:47,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:47,451 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:47,451 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:26:47,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:47,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:47,457 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) [2022-07-13 03:26:47,458 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 [2022-07-13 03:26:47,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:47,459 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:47,486 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:26:47,486 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:26:47,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:47,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:47,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:47,512 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) [2022-07-13 03:26:47,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:47,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:47,536 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 [2022-07-13 03:26:47,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:47,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:47,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:47,607 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) [2022-07-13 03:26:47,608 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 [2022-07-13 03:26:47,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:26:47,610 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:49,161 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:26:49,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:49,166 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:49,166 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:49,166 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:49,166 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:49,166 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:26:49,166 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,166 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:49,166 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:49,167 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration26_Loop [2022-07-13 03:26:49,167 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:49,167 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:49,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:49,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:49,337 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:49,337 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:26:49,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,339 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) [2022-07-13 03:26:49,339 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 [2022-07-13 03:26:49,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:49,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:49,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:49,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,364 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 [2022-07-13 03:26:49,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,365 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) [2022-07-13 03:26:49,366 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 [2022-07-13 03:26:49,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:49,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:49,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:49,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,391 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 [2022-07-13 03:26:49,392 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-13 03:26:49,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,393 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) [2022-07-13 03:26:49,393 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 [2022-07-13 03:26:49,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:49,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,401 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:49,402 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:49,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,419 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 [2022-07-13 03:26:49,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,421 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) [2022-07-13 03:26:49,422 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 [2022-07-13 03:26:49,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:49,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,428 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:49,431 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:49,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-07-13 03:26:49,450 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-13 03:26:49,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,451 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) [2022-07-13 03:26:49,452 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 [2022-07-13 03:26:49,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:49,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,460 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:49,462 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:49,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2022-07-13 03:26:49,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,499 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) [2022-07-13 03:26:49,500 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 [2022-07-13 03:26:49,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:49,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,507 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:49,510 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:49,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,530 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 [2022-07-13 03:26:49,530 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-13 03:26:49,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,531 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) [2022-07-13 03:26:49,532 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 [2022-07-13 03:26:49,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:49,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,540 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:49,542 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:49,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,560 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 [2022-07-13 03:26:49,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,562 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) [2022-07-13 03:26:49,562 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 [2022-07-13 03:26:49,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:49,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,570 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:49,574 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:49,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,596 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 [2022-07-13 03:26:49,596 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-13 03:26:49,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,597 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) [2022-07-13 03:26:49,598 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 [2022-07-13 03:26:49,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,605 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:49,605 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:49,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,606 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:49,607 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:49,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-07-13 03:26:49,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,627 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) [2022-07-13 03:26:49,628 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 [2022-07-13 03:26:49,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,637 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:49,637 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:49,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,637 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:49,643 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:49,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,664 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 [2022-07-13 03:26:49,664 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-13 03:26:49,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,665 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) [2022-07-13 03:26:49,666 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 [2022-07-13 03:26:49,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 [2022-07-13 03:26:49,673 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:49,673 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:49,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,674 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:49,675 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:49,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-07-13 03:26:49,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,697 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) [2022-07-13 03:26:49,698 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 [2022-07-13 03:26:49,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,706 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:49,706 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:49,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,707 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:49,715 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:49,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:49,750 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-13 03:26:49,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,752 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) [2022-07-13 03:26:49,753 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 [2022-07-13 03:26:49,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,761 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:49,761 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:49,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,761 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:49,764 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:49,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,786 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 [2022-07-13 03:26:49,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,788 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) [2022-07-13 03:26:49,788 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 [2022-07-13 03:26:49,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,796 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:49,796 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:49,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,797 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:49,806 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:49,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-07-13 03:26:49,844 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-13 03:26:49,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,845 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:49,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-07-13 03:26:49,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,855 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:49,855 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:49,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,855 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:49,857 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:49,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-07-13 03:26:49,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,877 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) [2022-07-13 03:26:49,878 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 [2022-07-13 03:26:49,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,885 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:49,885 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:49,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,886 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:49,889 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:49,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,910 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 [2022-07-13 03:26:49,910 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-13 03:26:49,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,911 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) [2022-07-13 03:26:49,912 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 [2022-07-13 03:26:49,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,920 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:49,920 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:49,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,920 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:49,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:49,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-07-13 03:26:49,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:49,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:49,945 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) [2022-07-13 03:26:49,946 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 [2022-07-13 03:26:49,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:49,954 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:49,954 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:49,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:49,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:49,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:49,954 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:49,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:49,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:49,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:49,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-07-13 03:26:49,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:49,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:26:49,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-07-13 03:26:49,984 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. cyclomatic complexity: 2 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) [2022-07-13 03:26:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:50,037 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2022-07-13 03:26:50,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 03:26:50,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 147 transitions. [2022-07-13 03:26:50,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-13 03:26:50,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 88 states and 88 transitions. [2022-07-13 03:26:50,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2022-07-13 03:26:50,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2022-07-13 03:26:50,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 88 transitions. [2022-07-13 03:26:50,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:50,040 INFO L369 hiAutomatonCegarLoop]: Abstraction has 88 states and 88 transitions. [2022-07-13 03:26:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 88 transitions. [2022-07-13 03:26:50,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-13 03:26:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.0) internal successors, (88), 87 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2022-07-13 03:26:50,041 INFO L392 hiAutomatonCegarLoop]: Abstraction has 88 states and 88 transitions. [2022-07-13 03:26:50,041 INFO L374 stractBuchiCegarLoop]: Abstraction has 88 states and 88 transitions. [2022-07-13 03:26:50,041 INFO L287 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2022-07-13 03:26:50,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 88 transitions. [2022-07-13 03:26:50,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-13 03:26:50,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:50,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:50,042 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 03:26:50,042 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:50,042 INFO L752 eck$LassoCheckResult]: Stem: 35141#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 35134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 35128#L59 assume !(0 == mp_add_~a3~0#1 % 256); 35129#L59-1 mp_add_~nb~0#1 := 4; 35137#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 35132#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 35133#L73 assume !(0 == mp_add_~b1~0#1 % 256); 35151#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 35142#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35143#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35139#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 35140#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35187#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35186#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35185#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35184#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 35183#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35182#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35181#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35180#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35179#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 35178#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35177#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35176#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35175#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35174#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35173#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35172#L84 assume !(0 == mp_add_~i~0#1 % 256); 35171#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 35170#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35169#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35168#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35167#L90 assume !(0 == mp_add_~i~0#1 % 256); 35166#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 35165#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35164#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35163#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35162#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35161#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 35160#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35159#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35158#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35157#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35156#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35155#L84 assume !(0 == mp_add_~i~0#1 % 256); 35154#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35153#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 35135#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35136#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35148#L90 assume !(0 == mp_add_~i~0#1 % 256); 35149#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35209#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 35208#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35207#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35205#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35203#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35190#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 35191#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35197#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35195#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35193#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35189#L84 assume !(0 == mp_add_~i~0#1 % 256); 35150#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35144#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35145#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 35211#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35210#L90 assume !(0 == mp_add_~i~0#1 % 256); 35152#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35124#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35125#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 35126#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35127#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35138#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35130#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35131#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 35146#L102-1 [2022-07-13 03:26:50,042 INFO L754 eck$LassoCheckResult]: Loop: 35146#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35147#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35206#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 35204#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35202#L90 assume !(0 == mp_add_~i~0#1 % 256); 35201#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35200#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35199#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35198#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35196#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35194#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35192#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35188#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35146#L102-1 [2022-07-13 03:26:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:50,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1089684886, now seen corresponding path program 1 times [2022-07-13 03:26:50,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:50,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338008966] [2022-07-13 03:26:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:50,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 55 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 03:26:50,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:50,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338008966] [2022-07-13 03:26:50,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338008966] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:50,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667690776] [2022-07-13 03:26:50,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:50,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:50,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:50,204 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:50,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-07-13 03:26:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:50,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 03:26:50,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 83 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 03:26:51,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 03:26:51,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667690776] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:51,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:51,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 9] total 20 [2022-07-13 03:26:51,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15703998] [2022-07-13 03:26:51,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:51,647 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:51,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash 922833652, now seen corresponding path program 4 times [2022-07-13 03:26:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:51,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909366412] [2022-07-13 03:26:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:51,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:51,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:51,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:51,739 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:51,739 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:51,739 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:51,739 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:51,740 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:26:51,740 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:51,740 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:51,740 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:51,740 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration27_Loop [2022-07-13 03:26:51,740 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:51,740 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:51,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:51,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:51,928 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:51,928 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:26:51,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:51,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:51,929 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) [2022-07-13 03:26:51,930 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 [2022-07-13 03:26:51,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:51,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:51,945 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:26:51,945 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:26:51,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2022-07-13 03:26:51,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:51,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:51,962 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) [2022-07-13 03:26:51,963 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 [2022-07-13 03:26:51,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:51,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:52,004 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 [2022-07-13 03:26:52,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:52,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:52,006 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) [2022-07-13 03:26:52,006 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 [2022-07-13 03:26:52,008 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:26:52,008 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:52,606 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:26:52,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2022-07-13 03:26:52,610 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:52,610 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:52,611 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:52,611 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:52,611 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:26:52,611 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:52,611 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:52,611 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:52,611 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration27_Loop [2022-07-13 03:26:52,611 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:52,611 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:52,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:52,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:52,810 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:52,810 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:26:52,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:52,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:52,812 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) [2022-07-13 03:26:52,813 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 [2022-07-13 03:26:52,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:52,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:52,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:52,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:52,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:52,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:52,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:52,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:52,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:52,837 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 [2022-07-13 03:26:52,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:52,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:52,839 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) [2022-07-13 03:26:52,839 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 [2022-07-13 03:26:52,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:52,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:52,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:52,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:52,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:52,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:52,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:52,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:52,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:52,865 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 [2022-07-13 03:26:52,865 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-13 03:26:52,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:52,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:52,866 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) [2022-07-13 03:26:52,867 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 [2022-07-13 03:26:52,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:52,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:52,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:52,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:52,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:52,874 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:52,875 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:52,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:52,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:52,892 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 [2022-07-13 03:26:52,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:52,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:52,894 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) [2022-07-13 03:26:52,895 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 [2022-07-13 03:26:52,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:52,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:52,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:52,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:52,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:52,903 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:52,906 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:52,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:52,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:52,924 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 [2022-07-13 03:26:52,924 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-13 03:26:52,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:52,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:52,926 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) [2022-07-13 03:26:52,926 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 [2022-07-13 03:26:52,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:52,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:52,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:52,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:52,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:52,934 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:52,935 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:52,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:52,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:52,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2022-07-13 03:26:52,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:52,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:52,965 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) [2022-07-13 03:26:52,965 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 [2022-07-13 03:26:52,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:52,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:52,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:52,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:52,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:52,973 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:52,976 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:52,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:52,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:52,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:52,998 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-13 03:26:52,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:52,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:52,999 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) [2022-07-13 03:26:53,001 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 [2022-07-13 03:26:53,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:53,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:53,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:53,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:53,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:53,009 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:53,011 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:53,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:53,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:53,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2022-07-13 03:26:53,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:53,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:53,031 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) [2022-07-13 03:26:53,032 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 [2022-07-13 03:26:53,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:53,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:53,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:53,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:53,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:53,040 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:53,043 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:53,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:53,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:53,064 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 [2022-07-13 03:26:53,065 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-13 03:26:53,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:53,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:53,067 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) [2022-07-13 03:26:53,067 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 [2022-07-13 03:26:53,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 [2022-07-13 03:26:53,074 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:53,074 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:53,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:53,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:53,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:53,074 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:53,076 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:53,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:53,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:53,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:53,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:53,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:53,096 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) [2022-07-13 03:26:53,096 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 [2022-07-13 03:26:53,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:53,103 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:53,103 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:53,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:53,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:53,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:53,104 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:53,106 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:53,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:53,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:53,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:53,129 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-13 03:26:53,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:53,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:53,130 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) [2022-07-13 03:26:53,131 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 [2022-07-13 03:26:53,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 [2022-07-13 03:26:53,138 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:53,139 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:53,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:53,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:53,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:53,139 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:53,141 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:53,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:53,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:53,161 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 [2022-07-13 03:26:53,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:53,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:53,163 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) [2022-07-13 03:26:53,163 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 [2022-07-13 03:26:53,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:53,172 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:53,172 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:53,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:53,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:53,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:53,172 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:53,176 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:53,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:53,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:53,201 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 [2022-07-13 03:26:53,201 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-13 03:26:53,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:53,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:53,202 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) [2022-07-13 03:26:53,203 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 [2022-07-13 03:26:53,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:53,213 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:53,213 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:53,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:53,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:53,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:53,213 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:53,216 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:53,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:53,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:53,259 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 [2022-07-13 03:26:53,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:53,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:53,260 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:53,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-07-13 03:26:53,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:53,268 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:53,269 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:53,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:53,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:53,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:53,269 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:53,274 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:53,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:53,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:53,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2022-07-13 03:26:53,307 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-13 03:26:53,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:53,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:53,308 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:53,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-07-13 03:26:53,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 [2022-07-13 03:26:53,315 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:53,315 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:53,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:53,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:53,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:53,315 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:53,317 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:53,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:53,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:53,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:53,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:53,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:53,337 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:53,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-07-13 03:26:53,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:53,345 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:53,345 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:53,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:53,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:53,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:53,345 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:53,348 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:53,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:53,354 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:53,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:53,371 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-13 03:26:53,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:53,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:53,372 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:53,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-07-13 03:26:53,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:53,380 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:53,380 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:53,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:53,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:53,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:53,380 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:53,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:53,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:53,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:53,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:53,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:53,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:53,405 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:53,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-07-13 03:26:53,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:53,412 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:53,413 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:53,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:53,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:53,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:53,413 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:53,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:53,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:53,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:53,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2022-07-13 03:26:53,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:53,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 03:26:53,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-07-13 03:26:53,442 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. cyclomatic complexity: 1 Second operand has 20 states, 20 states have (on average 8.15) internal successors, (163), 20 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:53,521 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2022-07-13 03:26:53,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 03:26:53,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 48 transitions. [2022-07-13 03:26:53,522 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 03:26:53,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2022-07-13 03:26:53,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-13 03:26:53,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-13 03:26:53,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-13 03:26:53,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:53,523 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:26:53,523 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:26:53,523 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:26:53,523 INFO L287 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2022-07-13 03:26:53,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-13 03:26:53,523 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 03:26:53,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-13 03:26:53,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:26:53 BoogieIcfgContainer [2022-07-13 03:26:53,528 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:26:53,529 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:26:53,529 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:26:53,529 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:26:53,529 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:26:19" (3/4) ... [2022-07-13 03:26:53,531 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 03:26:53,531 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:26:53,531 INFO L158 Benchmark]: Toolchain (without parser) took 35476.39ms. Allocated memory was 100.7MB in the beginning and 211.8MB in the end (delta: 111.1MB). Free memory was 69.3MB in the beginning and 143.9MB in the end (delta: -74.7MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2022-07-13 03:26:53,531 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 55.3MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:26:53,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.95ms. Allocated memory is still 100.7MB. Free memory was 69.0MB in the beginning and 74.3MB in the end (delta: -5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:26:53,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.01ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 66.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:26:53,532 INFO L158 Benchmark]: Boogie Preprocessor took 74.09ms. Allocated memory is still 100.7MB. Free memory was 66.0MB in the beginning and 61.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 03:26:53,532 INFO L158 Benchmark]: RCFGBuilder took 674.84ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 61.4MB in the beginning and 76.9MB in the end (delta: -15.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-13 03:26:53,532 INFO L158 Benchmark]: BuchiAutomizer took 34333.97ms. Allocated memory was 121.6MB in the beginning and 211.8MB in the end (delta: 90.2MB). Free memory was 76.9MB in the beginning and 143.9MB in the end (delta: -67.0MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2022-07-13 03:26:53,533 INFO L158 Benchmark]: Witness Printer took 2.19ms. Allocated memory is still 211.8MB. Free memory is still 143.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:26:53,534 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.18ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 55.3MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.95ms. Allocated memory is still 100.7MB. Free memory was 69.0MB in the beginning and 74.3MB in the end (delta: -5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.01ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 66.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.09ms. Allocated memory is still 100.7MB. Free memory was 66.0MB in the beginning and 61.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 674.84ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 61.4MB in the beginning and 76.9MB in the end (delta: -15.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 34333.97ms. Allocated memory was 121.6MB in the beginning and 211.8MB in the end (delta: 90.2MB). Free memory was 76.9MB in the beginning and 143.9MB in the end (delta: -67.0MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * Witness Printer took 2.19ms. Allocated memory is still 211.8MB. Free memory is still 143.9MB. There was no memory consumed. 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 27 terminating modules (27 trivial, 0 deterministic, 0 nondeterministic). 27 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.2s and 28 iterations. TraceHistogramMax:7. Analysis of lassos took 23.6s. Construction of modules took 4.9s. Büchi inclusion checks took 4.9s. Highest rank in rank-based complementation 0. Minimization of det autom 27. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 5882 StatesRemovedByMinimization, 23 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4135 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4135 mSDsluCounter, 3824 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 285 IncrementalHoareTripleChecker+Unchecked, 2554 mSDsCounter, 636 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6324 IncrementalHoareTripleChecker+Invalid, 7245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 636 mSolverCounterUnsat, 1270 mSDtfsCounter, 6324 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI17 SFLT0 conc2 concLT0 SILN0 SILU4 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital60 mio100 ax100 hnf100 lsp80 ukn100 mio100 lsp100 div387 bol100 ite100 ukn100 eq146 hnf96 smp34 dnf100 smp100 tf102 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 39ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.9s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-13 03:26:53,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2022-07-13 03:26:53,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2022-07-13 03:26:53,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2022-07-13 03:26:54,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:54,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-07-13 03:26:54,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:54,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-13 03:26:54,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 03:26:55,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-13 03:26:55,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-13 03:26:55,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 03:26:55,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 03:26:55,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:56,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:56,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:56,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:56,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE