./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/string-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 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/loops/string-2.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 fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 02:18:20,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 02:18:20,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 02:18:20,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 02:18:20,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 02:18:20,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 02:18:20,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 02:18:20,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 02:18:20,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 02:18:20,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 02:18:20,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 02:18:20,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 02:18:20,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 02:18:20,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 02:18:20,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 02:18:20,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 02:18:20,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 02:18:20,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 02:18:20,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 02:18:20,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 02:18:20,802 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 02:18:20,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 02:18:20,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 02:18:20,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 02:18:20,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 02:18:20,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 02:18:20,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 02:18:20,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 02:18:20,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 02:18:20,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 02:18:20,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 02:18:20,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 02:18:20,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 02:18:20,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 02:18:20,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 02:18:20,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 02:18:20,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 02:18:20,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 02:18:20,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 02:18:20,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 02:18:20,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 02:18:20,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 02:18:20,827 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 02:18:20,863 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 02:18:20,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 02:18:20,864 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 02:18:20,864 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 02:18:20,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 02:18:20,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 02:18:20,866 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 02:18:20,866 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 02:18:20,866 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 02:18:20,873 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 02:18:20,873 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 02:18:20,873 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 02:18:20,874 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 02:18:20,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 02:18:20,874 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 02:18:20,874 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 02:18:20,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 02:18:20,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 02:18:20,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 02:18:20,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 02:18:20,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 02:18:20,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 02:18:20,876 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 02:18:20,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 02:18:20,876 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 02:18:20,876 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 02:18:20,876 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 02:18:20,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 02:18:20,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 02:18:20,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 02:18:20,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 02:18:20,880 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 02:18:20,880 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 -> fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 [2022-07-22 02:18:21,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 02:18:21,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 02:18:21,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 02:18:21,262 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 02:18:21,263 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 02:18:21,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2022-07-22 02:18:21,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acfcdfc3a/0d1350a360b547b2b34a6ff29809aa83/FLAG5affab788 [2022-07-22 02:18:21,780 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 02:18:21,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2022-07-22 02:18:21,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acfcdfc3a/0d1350a360b547b2b34a6ff29809aa83/FLAG5affab788 [2022-07-22 02:18:21,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acfcdfc3a/0d1350a360b547b2b34a6ff29809aa83 [2022-07-22 02:18:21,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 02:18:21,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 02:18:21,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 02:18:21,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 02:18:21,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 02:18:21,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:18:21" (1/1) ... [2022-07-22 02:18:21,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12db1fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:21, skipping insertion in model container [2022-07-22 02:18:21,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:18:21" (1/1) ... [2022-07-22 02:18:21,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 02:18:21,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 02:18:21,986 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/loops/string-2.i[896,909] [2022-07-22 02:18:22,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:18:22,017 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 02:18:22,040 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/loops/string-2.i[896,909] [2022-07-22 02:18:22,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:18:22,089 INFO L208 MainTranslator]: Completed translation [2022-07-22 02:18:22,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:22 WrapperNode [2022-07-22 02:18:22,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 02:18:22,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 02:18:22,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 02:18:22,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 02:18:22,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:22" (1/1) ... [2022-07-22 02:18:22,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:22" (1/1) ... [2022-07-22 02:18:22,124 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2022-07-22 02:18:22,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 02:18:22,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 02:18:22,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 02:18:22,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 02:18:22,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:22" (1/1) ... [2022-07-22 02:18:22,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:22" (1/1) ... [2022-07-22 02:18:22,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:22" (1/1) ... [2022-07-22 02:18:22,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:22" (1/1) ... [2022-07-22 02:18:22,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:22" (1/1) ... [2022-07-22 02:18:22,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:22" (1/1) ... [2022-07-22 02:18:22,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:22" (1/1) ... [2022-07-22 02:18:22,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 02:18:22,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 02:18:22,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 02:18:22,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 02:18:22,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:22" (1/1) ... [2022-07-22 02:18:22,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:22,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:22,184 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-22 02:18:22,191 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-22 02:18:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 02:18:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 02:18:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 02:18:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 02:18:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 02:18:22,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 02:18:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 02:18:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 02:18:22,276 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 02:18:22,277 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 02:18:22,533 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 02:18:22,538 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 02:18:22,538 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-22 02:18:22,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:18:22 BoogieIcfgContainer [2022-07-22 02:18:22,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 02:18:22,541 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 02:18:22,550 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 02:18:22,553 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 02:18:22,553 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:18:22,553 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 02:18:21" (1/3) ... [2022-07-22 02:18:22,554 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10f8f94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:18:22, skipping insertion in model container [2022-07-22 02:18:22,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:18:22,554 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:22" (2/3) ... [2022-07-22 02:18:22,555 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10f8f94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:18:22, skipping insertion in model container [2022-07-22 02:18:22,555 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:18:22,555 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:18:22" (3/3) ... [2022-07-22 02:18:22,556 INFO L354 chiAutomizerObserver]: Analyzing ICFG string-2.i [2022-07-22 02:18:22,625 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 02:18:22,625 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 02:18:22,625 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 02:18:22,625 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 02:18:22,625 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 02:18:22,625 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 02:18:22,625 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 02:18:22,626 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 02:18:22,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 02:18:22,653 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2022-07-22 02:18:22,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:22,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:22,658 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 02:18:22,659 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:22,659 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 02:18:22,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 02:18:22,663 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2022-07-22 02:18:22,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:22,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:22,665 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 02:18:22,665 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:22,670 INFO L752 eck$LassoCheckResult]: Stem: 14#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(11, 2); 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 7#L35-3true [2022-07-22 02:18:22,671 INFO L754 eck$LassoCheckResult]: Loop: 7#L35-3true assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 9#L35-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 7#L35-3true [2022-07-22 02:18:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-22 02:18:22,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:22,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798853892] [2022-07-22 02:18:22,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,810 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:22,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-22 02:18:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:22,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018774120] [2022-07-22 02:18:22,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-22 02:18:22,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:22,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14439914] [2022-07-22 02:18:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,943 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:23,366 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:18:23,368 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:18:23,368 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:18:23,368 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:18:23,368 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:18:23,368 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:23,368 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:18:23,369 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:18:23,369 INFO L133 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration1_Lasso [2022-07-22 02:18:23,369 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:18:23,371 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:18:23,391 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-22 02:18:23,397 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-22 02:18:23,400 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-22 02:18:23,403 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-22 02:18:23,406 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-22 02:18:23,409 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-22 02:18:23,413 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-22 02:18:23,417 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-22 02:18:23,420 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-22 02:18:23,423 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-22 02:18:23,425 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-22 02:18:23,428 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-22 02:18:23,430 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-22 02:18:23,665 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-22 02:18:23,667 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-22 02:18:23,669 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-22 02:18:23,672 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-22 02:18:23,675 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-22 02:18:23,677 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-22 02:18:23,679 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-22 02:18:23,681 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-22 02:18:23,683 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-22 02:18:23,968 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:18:23,971 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:18:23,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:23,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:23,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:23,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:24,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:24,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:24,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 02:18:24,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:24,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:24,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 02:18:24,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:24,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:24,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:24,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:24,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 02:18:24,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-22 02:18:24,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:24,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:24,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:24,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:24,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,143 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:24,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 02:18:24,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:24,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:24,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:24,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:24,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,192 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:24,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 02:18:24,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:24,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:24,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:24,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:24,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,244 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:24,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 02:18:24,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:24,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:24,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:24,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:24,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 02:18:24,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:24,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:24,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:24,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:24,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,338 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:24,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 02:18:24,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:24,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:24,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:24,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,392 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:24,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 02:18:24,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:24,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:24,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:24,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-22 02:18:24,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,432 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:24,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 02:18:24,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:24,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:24,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:24,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-07-22 02:18:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,473 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:24,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 02:18:24,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:24,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:24,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:24,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:24,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:24,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,501 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-22 02:18:24,505 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-22 02:18:24,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:24,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:24,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:24,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:24,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,540 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-22 02:18:24,541 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-22 02:18:24,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:24,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:24,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:24,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,574 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-22 02:18:24,575 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-22 02:18:24,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:24,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:24,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:24,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:24,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,600 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-22 02:18:24,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,601 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-22 02:18:24,602 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-22 02:18:24,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-22 02:18:24,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:24,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:24,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-22 02:18:24,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,644 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-22 02:18:24,645 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-22 02:18:24,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:24,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:24,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:24,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,684 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-22 02:18:24,684 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-22 02:18:24,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:24,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:24,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,737 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-22 02:18:24,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,739 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-22 02:18:24,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:24,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:24,759 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-22 02:18:24,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,793 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-22 02:18:24,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,794 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-22 02:18:24,799 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-22 02:18:24,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:24,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:24,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,847 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-22 02:18:24,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,854 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-22 02:18:24,855 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-22 02:18:24,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:24,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:24,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,887 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-22 02:18:24,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,889 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-22 02:18:24,890 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-22 02:18:24,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-22 02:18:24,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:24,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:24,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:24,954 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-22 02:18:24,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:24,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:24,956 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-22 02:18:24,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:24,967 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-22 02:18:24,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:24,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:24,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:24,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:24,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:24,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:24,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:24,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:25,000 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-22 02:18:25,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:25,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:25,002 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-22 02:18:25,002 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-22 02:18:25,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:25,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:25,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:25,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:25,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:25,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:25,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:25,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:25,062 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-22 02:18:25,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:25,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:25,063 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-22 02:18:25,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:25,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:25,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:25,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:25,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:25,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:25,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:25,080 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-22 02:18:25,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:25,114 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-22 02:18:25,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:25,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:25,116 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-22 02:18:25,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 02:18:25,126 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-22 02:18:25,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:25,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:25,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:25,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:25,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:25,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:25,145 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:18:25,170 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-07-22 02:18:25,170 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-22 02:18:25,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:25,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:25,173 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-22 02:18:25,174 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-22 02:18:25,175 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:18:25,197 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 02:18:25,197 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:18:25,198 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 9*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_1 - 2*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-22 02:18:25,222 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-22 02:18:25,241 INFO L293 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2022-07-22 02:18:25,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:25,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:18:25,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:18:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:25,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 02:18:25,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:18:25,313 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-22 02:18:25,336 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 02:18:25,337 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 02:18:25,379 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 80 transitions. Complement of second has 8 states. [2022-07-22 02:18:25,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 02:18:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 02:18:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-07-22 02:18:25,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 02:18:25,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:18:25,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 02:18:25,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:18:25,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-22 02:18:25,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:18:25,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 80 transitions. [2022-07-22 02:18:25,391 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:25,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 19 states and 28 transitions. [2022-07-22 02:18:25,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-22 02:18:25,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-22 02:18:25,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2022-07-22 02:18:25,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:18:25,396 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-07-22 02:18:25,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2022-07-22 02:18:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-22 02:18:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 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-22 02:18:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2022-07-22 02:18:25,423 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-07-22 02:18:25,424 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-07-22 02:18:25,424 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 02:18:25,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2022-07-22 02:18:25,425 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:25,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:25,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:25,425 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 02:18:25,426 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:25,426 INFO L752 eck$LassoCheckResult]: Stem: 152#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(11, 2); 153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 161#L35-3 assume !(main_~i~0#1 < 5); 158#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 159#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 149#L39-3 [2022-07-22 02:18:25,426 INFO L754 eck$LassoCheckResult]: Loop: 149#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 151#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 149#L39-3 [2022-07-22 02:18:25,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:25,427 INFO L85 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2022-07-22 02:18:25,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:25,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024528078] [2022-07-22 02:18:25,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:25,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:25,496 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-22 02:18:25,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:18:25,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024528078] [2022-07-22 02:18:25,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024528078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:18:25,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:18:25,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:18:25,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011838712] [2022-07-22 02:18:25,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:18:25,501 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:18:25,501 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-22 02:18:25,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:25,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2022-07-22 02:18:25,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:25,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028120977] [2022-07-22 02:18:25,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:25,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:25,520 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:25,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:25,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:18:25,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:18:25,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:18:25,565 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-22 02:18:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:18:25,587 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-07-22 02:18:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:18:25,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2022-07-22 02:18:25,589 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:25,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2022-07-22 02:18:25,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-22 02:18:25,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-22 02:18:25,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2022-07-22 02:18:25,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:18:25,591 INFO L369 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-07-22 02:18:25,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2022-07-22 02:18:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-07-22 02:18:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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-22 02:18:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-07-22 02:18:25,593 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-22 02:18:25,593 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-22 02:18:25,594 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 02:18:25,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-07-22 02:18:25,594 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:25,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:25,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:25,595 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:18:25,595 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:25,595 INFO L752 eck$LassoCheckResult]: Stem: 200#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(11, 2); 201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 209#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 210#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 211#L35-3 assume !(main_~i~0#1 < 5); 206#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 207#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 196#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 197#L39-2 [2022-07-22 02:18:25,595 INFO L754 eck$LassoCheckResult]: Loop: 197#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 213#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 197#L39-2 [2022-07-22 02:18:25,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:25,595 INFO L85 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2022-07-22 02:18:25,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:25,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451592788] [2022-07-22 02:18:25,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:25,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:18:25,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:18:25,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451592788] [2022-07-22 02:18:25,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451592788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 02:18:25,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519307420] [2022-07-22 02:18:25,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:25,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:18:25,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:25,623 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 02:18:25,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-22 02:18:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:25,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 02:18:25,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:18:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:18:25,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 02:18:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:18:25,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519307420] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 02:18:25,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 02:18:25,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-22 02:18:25,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587628055] [2022-07-22 02:18:25,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 02:18:25,704 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:18:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2022-07-22 02:18:25,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:25,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391202915] [2022-07-22 02:18:25,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:25,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:25,710 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:25,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:25,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:18:25,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 02:18:25,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 02:18:25,743 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:18:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:18:25,813 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-07-22 02:18:25,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 02:18:25,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2022-07-22 02:18:25,819 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:25,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2022-07-22 02:18:25,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 02:18:25,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-07-22 02:18:25,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2022-07-22 02:18:25,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:18:25,825 INFO L369 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-22 02:18:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2022-07-22 02:18:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-07-22 02:18:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:18:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-07-22 02:18:25,832 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-07-22 02:18:25,832 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-07-22 02:18:25,832 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 02:18:25,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2022-07-22 02:18:25,834 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:25,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:25,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:25,835 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2022-07-22 02:18:25,835 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:25,835 INFO L752 eck$LassoCheckResult]: Stem: 312#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(11, 2); 313#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 321#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 322#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 323#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 324#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 339#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 338#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 337#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 336#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 335#L35-3 assume !(main_~i~0#1 < 5); 318#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 319#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 308#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 309#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 326#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 334#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 333#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 332#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 331#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 330#L39-2 [2022-07-22 02:18:25,835 INFO L754 eck$LassoCheckResult]: Loop: 330#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 329#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 330#L39-2 [2022-07-22 02:18:25,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:25,835 INFO L85 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 1 times [2022-07-22 02:18:25,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:25,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554066157] [2022-07-22 02:18:25,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:25,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 02:18:25,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:18:25,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554066157] [2022-07-22 02:18:25,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554066157] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 02:18:25,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752983268] [2022-07-22 02:18:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:25,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:18:25,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:25,930 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 02:18:25,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-22 02:18:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:25,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 02:18:25,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:18:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 02:18:26,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 02:18:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 02:18:26,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752983268] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 02:18:26,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 02:18:26,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-22 02:18:26,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911483065] [2022-07-22 02:18:26,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 02:18:26,040 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:18:26,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:26,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2022-07-22 02:18:26,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:26,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595093048] [2022-07-22 02:18:26,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:26,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:26,045 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:26,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:26,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:18:26,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 02:18:26,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-22 02:18:26,086 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-22 02:18:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:18:26,155 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-22 02:18:26,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 02:18:26,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2022-07-22 02:18:26,156 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:26,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2022-07-22 02:18:26,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-07-22 02:18:26,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-07-22 02:18:26,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2022-07-22 02:18:26,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:18:26,158 INFO L369 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-07-22 02:18:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2022-07-22 02:18:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-07-22 02:18:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:18:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-22 02:18:26,160 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-22 02:18:26,160 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-22 02:18:26,160 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 02:18:26,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2022-07-22 02:18:26,161 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:26,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:26,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:26,161 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2022-07-22 02:18:26,161 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:26,162 INFO L752 eck$LassoCheckResult]: Stem: 515#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(11, 2); 516#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 524#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 525#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 526#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 527#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 546#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 545#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 544#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 543#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 542#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 541#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 540#L35-3 assume !(main_~i~0#1 < 5); 521#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 522#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 528#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 530#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 511#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 512#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 539#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 538#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 537#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 536#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 535#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 534#L39-2 [2022-07-22 02:18:26,162 INFO L754 eck$LassoCheckResult]: Loop: 534#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 533#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 534#L39-2 [2022-07-22 02:18:26,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 2 times [2022-07-22 02:18:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:26,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741039554] [2022-07-22 02:18:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:26,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:26,204 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:26,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:26,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:26,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2022-07-22 02:18:26,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:26,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587417819] [2022-07-22 02:18:26,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:26,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:26,244 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:26,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:26,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 3 times [2022-07-22 02:18:26,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:26,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986271985] [2022-07-22 02:18:26,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:26,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 02:18:26,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:18:26,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986271985] [2022-07-22 02:18:26,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986271985] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 02:18:26,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396558690] [2022-07-22 02:18:26,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 02:18:26,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:18:26,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:26,359 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 02:18:26,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-22 02:18:26,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-22 02:18:26,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 02:18:26,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 02:18:26,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:18:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 02:18:26,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 02:18:26,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396558690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:18:26,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 02:18:26,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-07-22 02:18:26,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187318186] [2022-07-22 02:18:26,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:18:26,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:18:26,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 02:18:26,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-07-22 02:18:26,523 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-22 02:18:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:18:26,618 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-07-22 02:18:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 02:18:26,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 57 transitions. [2022-07-22 02:18:26,621 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:26,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 57 transitions. [2022-07-22 02:18:26,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-22 02:18:26,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2022-07-22 02:18:26,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 57 transitions. [2022-07-22 02:18:26,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:18:26,624 INFO L369 hiAutomatonCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-07-22 02:18:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 57 transitions. [2022-07-22 02:18:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2022-07-22 02:18:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 02:18:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-07-22 02:18:26,630 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-07-22 02:18:26,630 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-07-22 02:18:26,630 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 02:18:26,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 39 transitions. [2022-07-22 02:18:26,632 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-22 02:18:26,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:26,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:26,633 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:18:26,633 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:26,634 INFO L752 eck$LassoCheckResult]: Stem: 688#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(11, 2); 689#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 697#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 698#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 702#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 719#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 718#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 717#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 716#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 715#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 714#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 713#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 711#L35-3 assume !(main_~i~0#1 < 5); 694#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 695#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 684#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 685#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 700#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 712#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 710#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 709#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 708#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 707#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 706#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 705#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 704#L39-3 assume !(main_~i~0#1 < 5); 703#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 699#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 690#L44-3 [2022-07-22 02:18:26,634 INFO L754 eck$LassoCheckResult]: Loop: 690#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 691#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 690#L44-3 [2022-07-22 02:18:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2022-07-22 02:18:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:26,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269185656] [2022-07-22 02:18:26,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:26,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:26,678 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:26,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:26,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2022-07-22 02:18:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:26,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881847865] [2022-07-22 02:18:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:26,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:26,700 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:26,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:26,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:26,703 INFO L85 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2022-07-22 02:18:26,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:26,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226853178] [2022-07-22 02:18:26,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:26,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:26,722 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:26,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:30,824 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:18:30,824 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:18:30,824 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:18:30,824 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:18:30,825 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:18:30,825 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:30,825 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:18:30,825 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:18:30,825 INFO L133 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration6_Lasso [2022-07-22 02:18:30,825 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:18:30,825 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:18:30,832 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-22 02:18:30,834 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-22 02:18:30,836 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-22 02:18:30,838 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-22 02:18:30,839 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-22 02:18:30,841 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-22 02:18:31,849 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 02:18:31,858 INFO L158 Benchmark]: Toolchain (without parser) took 10048.01ms. Allocated memory was 50.3MB in the beginning and 92.3MB in the end (delta: 41.9MB). Free memory was 27.2MB in the beginning and 53.4MB in the end (delta: -26.2MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2022-07-22 02:18:31,858 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 50.3MB. Free memory was 32.1MB in the beginning and 32.1MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:18:31,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.32ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 27.1MB in the beginning and 45.5MB in the end (delta: -18.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-07-22 02:18:31,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.42ms. Allocated memory is still 62.9MB. Free memory was 45.5MB in the beginning and 43.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:18:31,860 INFO L158 Benchmark]: Boogie Preprocessor took 29.23ms. Allocated memory is still 62.9MB. Free memory was 43.8MB in the beginning and 42.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:18:31,860 INFO L158 Benchmark]: RCFGBuilder took 385.18ms. Allocated memory is still 62.9MB. Free memory was 42.5MB in the beginning and 30.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 02:18:31,861 INFO L158 Benchmark]: BuchiAutomizer took 9315.62ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 30.7MB in the beginning and 53.4MB in the end (delta: -22.7MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2022-07-22 02:18:31,862 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.19ms. Allocated memory is still 50.3MB. Free memory was 32.1MB in the beginning and 32.1MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.32ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 27.1MB in the beginning and 45.5MB in the end (delta: -18.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.42ms. Allocated memory is still 62.9MB. Free memory was 45.5MB in the beginning and 43.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.23ms. Allocated memory is still 62.9MB. Free memory was 43.8MB in the beginning and 42.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.18ms. Allocated memory is still 62.9MB. Free memory was 42.5MB in the beginning and 30.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 9315.62ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 30.7MB in the beginning and 53.4MB in the end (delta: -22.7MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 02:18:31,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-07-22 02:18:32,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-07-22 02:18:32,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-22 02:18:32,493 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null