./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash e6d71d49c6e185294c0f1f4729e12b8d7df6d1365b5d24a48890a0be5b6780c4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:24:52,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:24:52,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:24:52,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:24:52,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:24:52,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:24:52,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:24:52,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:24:52,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:24:52,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:24:52,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:24:52,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:24:52,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:24:52,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:24:52,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:24:52,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:24:52,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:24:52,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:24:52,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:24:52,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:24:52,871 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:24:52,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:24:52,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:24:52,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:24:52,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:24:52,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:24:52,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:24:52,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:24:52,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:24:52,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:24:52,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:24:52,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:24:52,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:24:52,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:24:52,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:24:52,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:24:52,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:24:52,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:24:52,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:24:52,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:24:52,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:24:52,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:24:52,891 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:24:52,919 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:24:52,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:24:52,920 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:24:52,920 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:24:52,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:24:52,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:24:52,921 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:24:52,921 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:24:52,921 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:24:52,922 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:24:52,922 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:24:52,922 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:24:52,923 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:24:52,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:24:52,923 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:24:52,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:24:52,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:24:52,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:24:52,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:24:52,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:24:52,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:24:52,924 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:24:52,924 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:24:52,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:24:52,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:24:52,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:24:52,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:24:52,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:24:52,926 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:24:52,926 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6d71d49c6e185294c0f1f4729e12b8d7df6d1365b5d24a48890a0be5b6780c4 [2022-07-13 03:24:53,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:24:53,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:24:53,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:24:53,162 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:24:53,163 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:24:53,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2022-07-13 03:24:53,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5098cd47a/3ef50f63ce464c57b7c96b8126ec72d1/FLAG6de6c5ca4 [2022-07-13 03:24:53,544 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:24:53,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2022-07-13 03:24:53,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5098cd47a/3ef50f63ce464c57b7c96b8126ec72d1/FLAG6de6c5ca4 [2022-07-13 03:24:53,980 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5098cd47a/3ef50f63ce464c57b7c96b8126ec72d1 [2022-07-13 03:24:53,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:24:53,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:24:53,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:24:53,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:24:53,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:24:53,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75eeeb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53, skipping insertion in model container [2022-07-13 03:24:53,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:24:54,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:24:54,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:24:54,127 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:24:54,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:24:54,147 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:24:54,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:54 WrapperNode [2022-07-13 03:24:54,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:24:54,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:24:54,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:24:54,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:24:54,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:54" (1/1) ... [2022-07-13 03:24:54,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:54" (1/1) ... [2022-07-13 03:24:54,173 INFO L137 Inliner]: procedures = 12, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2022-07-13 03:24:54,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:24:54,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:24:54,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:24:54,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:24:54,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:54" (1/1) ... [2022-07-13 03:24:54,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:54" (1/1) ... [2022-07-13 03:24:54,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:54" (1/1) ... [2022-07-13 03:24:54,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:54" (1/1) ... [2022-07-13 03:24:54,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:54" (1/1) ... [2022-07-13 03:24:54,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:54" (1/1) ... [2022-07-13 03:24:54,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:54" (1/1) ... [2022-07-13 03:24:54,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:24:54,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:24:54,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:24:54,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:24:54,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:54" (1/1) ... [2022-07-13 03:24:54,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:54,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:54,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:54,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:24:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:24:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2022-07-13 03:24:54,273 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2022-07-13 03:24:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 03:24:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:24:54,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:24:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:24:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:24:54,343 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:24:54,345 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:24:54,576 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:24:54,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:24:54,584 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 03:24:54,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:24:54 BoogieIcfgContainer [2022-07-13 03:24:54,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:24:54,587 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:24:54,588 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:24:54,590 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:24:54,591 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:24:54,591 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:24:53" (1/3) ... [2022-07-13 03:24:54,593 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@282d3329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:24:54, skipping insertion in model container [2022-07-13 03:24:54,593 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:24:54,593 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:54" (2/3) ... [2022-07-13 03:24:54,594 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@282d3329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:24:54, skipping insertion in model container [2022-07-13 03:24:54,594 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:24:54,594 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:24:54" (3/3) ... [2022-07-13 03:24:54,596 INFO L354 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2022-07-13 03:24:54,642 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:24:54,642 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:24:54,642 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:24:54,642 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:24:54,643 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:24:54,643 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:24:54,643 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:24:54,643 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:24:54,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 03:24:54,676 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-07-13 03:24:54,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:54,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:54,680 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:24:54,680 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:24:54,680 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:24:54,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 03:24:54,685 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-07-13 03:24:54,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:54,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:54,686 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:24:54,686 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:24:54,691 INFO L752 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16#L35true assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 10#L40-3true [2022-07-13 03:24:54,691 INFO L754 eck$LassoCheckResult]: Loop: 10#L40-3true assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 11#L40-2true main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 10#L40-3true [2022-07-13 03:24:54,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:54,697 INFO L85 PathProgramCache]: Analyzing trace with hash 89440, now seen corresponding path program 1 times [2022-07-13 03:24:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:54,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401477235] [2022-07-13 03:24:54,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:54,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:54,793 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:54,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2022-07-13 03:24:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:54,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481129870] [2022-07-13 03:24:54,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:54,845 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:54,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:54,865 INFO L85 PathProgramCache]: Analyzing trace with hash 85954242, now seen corresponding path program 1 times [2022-07-13 03:24:54,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:54,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692744211] [2022-07-13 03:24:54,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:54,896 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:54,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:55,086 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:24:55,086 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:24:55,086 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:24:55,086 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:24:55,087 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:24:55,087 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,087 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:24:55,087 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:24:55,088 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2022-07-13 03:24:55,088 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:24:55,088 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:24:55,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:55,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:55,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:55,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:55,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:55,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:55,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:55,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:55,310 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:24:55,313 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:24:55,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,316 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-13 03:24:55,317 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-13 03:24:55,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:55,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:55,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:55,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:55,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:55,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:55,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:55,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:55,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:55,360 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-13 03:24:55,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,361 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-13 03:24:55,375 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-13 03:24:55,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:55,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:55,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:55,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:55,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:55,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:55,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:55,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:55,419 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-13 03:24:55,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,422 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-13 03:24:55,424 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-13 03:24:55,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:55,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:55,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:55,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:55,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:55,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:55,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:55,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:55,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:55,473 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-13 03:24:55,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,475 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-13 03:24:55,476 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-13 03:24:55,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:55,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:55,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:55,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:55,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:55,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:55,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:55,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:55,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:55,517 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-13 03:24:55,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,520 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-13 03:24:55,521 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-13 03:24:55,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:55,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:55,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:55,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:55,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:55,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:55,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:55,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:55,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:55,562 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-13 03:24:55,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,565 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-13 03:24:55,566 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-13 03:24:55,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:55,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:55,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:55,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:55,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:55,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:55,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:55,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:55,612 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-13 03:24:55,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,614 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-13 03:24:55,615 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-13 03:24:55,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:55,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:55,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:55,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:55,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:55,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:55,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:55,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:55,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:55,659 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-13 03:24:55,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,661 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-13 03:24:55,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:55,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:55,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:55,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:55,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:55,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:55,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:55,710 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-13 03:24:55,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:24:55,737 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-13 03:24:55,737 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-07-13 03:24:55,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,740 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-13 03:24:55,753 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-13 03:24:55,754 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:24:55,768 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 03:24:55,769 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:24:55,769 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1) = -2*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1 Supporting invariants [-2*ULTIMATE.start_main_~n~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1 >= 0] [2022-07-13 03:24:55,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-13 03:24:55,793 INFO L293 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-07-13 03:24:55,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:55,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:24:55,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:55,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:24:55,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:24:55,921 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-13 03:24:55,922 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-13 03:24:55,972 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). 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) Result 61 states and 85 transitions. Complement of second has 9 states. [2022-07-13 03:24:55,973 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-13 03:24:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. 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-13 03:24:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-07-13 03:24:55,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-13 03:24:55,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:55,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-13 03:24:55,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:55,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 4 letters. [2022-07-13 03:24:55,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:55,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 85 transitions. [2022-07-13 03:24:55,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-13 03:24:55,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 27 states and 38 transitions. [2022-07-13 03:24:55,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-13 03:24:55,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-07-13 03:24:55,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2022-07-13 03:24:55,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:55,987 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 38 transitions. [2022-07-13 03:24:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2022-07-13 03:24:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-13 03:24:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 03:24:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2022-07-13 03:24:56,007 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 38 transitions. [2022-07-13 03:24:56,007 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2022-07-13 03:24:56,007 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:24:56,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 38 transitions. [2022-07-13 03:24:56,008 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-13 03:24:56,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:56,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:56,008 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:24:56,008 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:24:56,009 INFO L752 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 160#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 162#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 149#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 155#merge_sortENTRY [2022-07-13 03:24:56,009 INFO L754 eck$LassoCheckResult]: Loop: 155#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 156#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 150#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 155#merge_sortENTRY [2022-07-13 03:24:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash 85954193, now seen corresponding path program 1 times [2022-07-13 03:24:56,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506378918] [2022-07-13 03:24:56,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:24:56,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:56,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506378918] [2022-07-13 03:24:56,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506378918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:24:56,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:24:56,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:24:56,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649445406] [2022-07-13 03:24:56,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:24:56,046 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:24:56,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,047 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 1 times [2022-07-13 03:24:56,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298449977] [2022-07-13 03:24:56,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,057 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:56,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:56,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:24:56,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:24:56,183 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. cyclomatic complexity: 15 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:24:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:24:56,196 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-07-13 03:24:56,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:24:56,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 36 transitions. [2022-07-13 03:24:56,198 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-13 03:24:56,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 36 transitions. [2022-07-13 03:24:56,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-07-13 03:24:56,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-07-13 03:24:56,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2022-07-13 03:24:56,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:56,200 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-07-13 03:24:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2022-07-13 03:24:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-13 03:24:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 03:24:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-07-13 03:24:56,202 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-13 03:24:56,202 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-13 03:24:56,202 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:24:56,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2022-07-13 03:24:56,203 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-13 03:24:56,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:56,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:56,203 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:56,203 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:24:56,204 INFO L752 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 221#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 223#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 224#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 225#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 212#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 218#merge_sortENTRY [2022-07-13 03:24:56,204 INFO L754 eck$LassoCheckResult]: Loop: 218#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 219#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 210#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 218#merge_sortENTRY [2022-07-13 03:24:56,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash 997650291, now seen corresponding path program 1 times [2022-07-13 03:24:56,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15805167] [2022-07-13 03:24:56,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,214 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:56,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 2 times [2022-07-13 03:24:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578118868] [2022-07-13 03:24:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,229 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:56,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,235 INFO L85 PathProgramCache]: Analyzing trace with hash -173868929, now seen corresponding path program 1 times [2022-07-13 03:24:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955801156] [2022-07-13 03:24:56,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:56,279 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-13 03:24:56,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:56,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955801156] [2022-07-13 03:24:56,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955801156] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:24:56,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111748788] [2022-07-13 03:24:56,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:24:56,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:56,281 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:24:56,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 03:24:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:56,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:24:56,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:56,367 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-13 03:24:56,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:24:56,389 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-13 03:24:56,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111748788] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:24:56,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:24:56,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-13 03:24:56,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73736602] [2022-07-13 03:24:56,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:24:56,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:56,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 03:24:56,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 03:24:56,513 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:24:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:24:56,575 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-07-13 03:24:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 03:24:56,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2022-07-13 03:24:56,579 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-13 03:24:56,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 32 states and 41 transitions. [2022-07-13 03:24:56,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-13 03:24:56,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-13 03:24:56,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2022-07-13 03:24:56,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:56,581 INFO L369 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-13 03:24:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2022-07-13 03:24:56,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-07-13 03:24:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 03:24:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-13 03:24:56,583 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-13 03:24:56,583 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-13 03:24:56,583 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:24:56,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2022-07-13 03:24:56,583 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-13 03:24:56,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:56,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:56,584 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-07-13 03:24:56,584 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:24:56,584 INFO L752 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 355#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 356#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 358#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 359#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 360#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 361#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 372#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 346#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 351#merge_sortENTRY [2022-07-13 03:24:56,584 INFO L754 eck$LassoCheckResult]: Loop: 351#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 352#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 345#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 351#merge_sortENTRY [2022-07-13 03:24:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,584 INFO L85 PathProgramCache]: Analyzing trace with hash 964272085, now seen corresponding path program 2 times [2022-07-13 03:24:56,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50136322] [2022-07-13 03:24:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,608 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:56,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,617 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 3 times [2022-07-13 03:24:56,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573294491] [2022-07-13 03:24:56,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1888408797, now seen corresponding path program 2 times [2022-07-13 03:24:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565716916] [2022-07-13 03:24:56,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,692 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:57,076 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:24:57,077 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:24:57,077 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:24:57,077 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:24:57,077 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:24:57,077 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:57,077 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:24:57,077 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:24:57,077 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2022-07-13 03:24:57,077 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:24:57,077 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:24:57,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:57,487 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:24:57,487 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:24:57,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:57,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:57,488 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-13 03:24:57,489 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-13 03:24:57,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:57,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:57,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:57,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:57,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:57,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:57,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:57,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:57,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:57,529 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-13 03:24:57,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:57,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:57,530 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:57,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 03:24:57,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:57,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:57,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:57,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:57,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:57,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:57,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:57,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:57,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:57,570 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-13 03:24:57,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:57,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:57,572 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:57,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 03:24:57,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:57,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:57,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:57,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:57,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:57,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:57,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:57,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:57,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:57,613 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-13 03:24:57,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:57,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:57,614 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:57,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-13 03:24:57,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:57,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:57,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:57,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:57,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:57,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:57,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:57,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:57,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:57,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:57,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:57,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:57,652 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:57,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-13 03:24:57,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:57,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:57,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:57,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:57,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:57,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:57,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:57,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:57,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:57,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:57,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:57,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:57,687 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:57,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-13 03:24:57,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:57,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:57,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:57,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:57,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:57,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:57,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:57,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:57,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:57,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-13 03:24:57,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:57,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:57,726 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:57,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-13 03:24:57,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:57,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:57,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:57,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:57,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:57,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:57,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:57,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:57,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:57,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:57,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:57,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:57,776 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:57,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-13 03:24:57,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:57,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:57,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:57,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:57,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:57,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:57,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:57,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:57,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:57,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:57,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:57,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:57,838 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:57,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-13 03:24:57,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:57,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:57,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:57,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:57,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:57,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:57,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:57,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:57,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:57,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:57,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:57,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:57,905 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:57,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-13 03:24:57,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:57,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:57,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:57,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:57,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:57,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:57,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:57,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:57,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:57,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:57,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:57,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:57,944 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:57,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-13 03:24:57,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:57,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:57,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:57,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:57,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:57,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:57,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:57,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:57,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:57,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:57,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:57,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:57,985 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:57,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-13 03:24:57,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:57,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:57,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:57,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:57,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:57,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:57,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:58,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:58,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:58,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:58,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:58,024 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:58,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-13 03:24:58,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:58,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:58,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:58,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:58,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:58,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:58,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:58,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:58,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:58,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:58,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:58,055 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:58,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-13 03:24:58,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:58,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:58,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:58,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:58,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:58,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:58,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:58,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:58,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:58,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:58,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:58,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:58,092 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:58,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-13 03:24:58,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:58,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:58,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:58,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:58,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:58,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:58,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:58,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:58,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:58,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:58,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:58,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:58,126 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:58,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-13 03:24:58,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:58,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:58,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:58,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:58,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:58,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:58,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:58,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:58,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:58,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:58,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:58,169 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:58,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-13 03:24:58,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:58,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:58,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:58,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:58,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:58,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:58,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:58,197 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:24:58,206 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-13 03:24:58,207 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-13 03:24:58,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:58,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:58,208 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:58,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-13 03:24:58,210 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:24:58,215 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:24:58,215 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:24:58,215 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n#1) = 1*merge_sort_#in~n#1 Supporting invariants [] [2022-07-13 03:24:58,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-13 03:24:58,237 INFO L293 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2022-07-13 03:24:58,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:58,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:24:58,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:58,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 03:24:58,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:24:58,301 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-13 03:24:58,301 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 12 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:24:58,331 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 12. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 59 transitions. Complement of second has 12 states. [2022-07-13 03:24:58,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 03:24:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:24:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-07-13 03:24:58,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2022-07-13 03:24:58,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:58,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2022-07-13 03:24:58,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:58,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2022-07-13 03:24:58,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:58,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2022-07-13 03:24:58,334 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-13 03:24:58,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 38 states and 50 transitions. [2022-07-13 03:24:58,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-13 03:24:58,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-13 03:24:58,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. [2022-07-13 03:24:58,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:24:58,335 INFO L369 hiAutomatonCegarLoop]: Abstraction has 38 states and 50 transitions. [2022-07-13 03:24:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. [2022-07-13 03:24:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-07-13 03:24:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 03:24:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-07-13 03:24:58,337 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-07-13 03:24:58,337 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-07-13 03:24:58,338 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:24:58,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2022-07-13 03:24:58,338 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-13 03:24:58,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:58,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:58,339 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:58,339 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:58,339 INFO L752 eck$LassoCheckResult]: Stem: 524#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 510#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 511#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 513#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 514#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 515#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 516#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 531#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 500#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 504#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 505#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 498#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 506#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 507#L24 assume ~n#1 < 2; 522#merge_sortFINAL assume true; 521#merge_sortEXIT >#87#return; 499#L27-1 [2022-07-13 03:24:58,339 INFO L754 eck$LassoCheckResult]: Loop: 499#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 523#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 530#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 497#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 523#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 530#L24 assume ~n#1 < 2; 512#merge_sortFINAL assume true; 529#merge_sortEXIT >#87#return; 499#L27-1 [2022-07-13 03:24:58,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:58,339 INFO L85 PathProgramCache]: Analyzing trace with hash 825176348, now seen corresponding path program 1 times [2022-07-13 03:24:58,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:58,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582261171] [2022-07-13 03:24:58,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:58,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:58,350 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:58,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:58,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:58,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1429943866, now seen corresponding path program 1 times [2022-07-13 03:24:58,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:58,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139645241] [2022-07-13 03:24:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:58,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:58,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:58,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:58,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1545528235, now seen corresponding path program 1 times [2022-07-13 03:24:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:58,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795226665] [2022-07-13 03:24:58,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:58,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-13 03:24:58,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 03:24:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:58,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 03:24:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 03:24:58,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:58,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795226665] [2022-07-13 03:24:58,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795226665] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:24:58,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154702327] [2022-07-13 03:24:58,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:58,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:24:58,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:58,534 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-13 03:24:58,535 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-13 03:24:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:58,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 03:24:58,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:24:58,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:24:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 03:24:58,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154702327] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:24:58,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:24:58,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2022-07-13 03:24:58,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166202292] [2022-07-13 03:24:58,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:24:58,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:58,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 03:24:58,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-13 03:24:58,967 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 15 Second operand has 15 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-13 03:24:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:24:59,174 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-07-13 03:24:59,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 03:24:59,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 91 transitions. [2022-07-13 03:24:59,176 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2022-07-13 03:24:59,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 86 transitions. [2022-07-13 03:24:59,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-07-13 03:24:59,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2022-07-13 03:24:59,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 86 transitions. [2022-07-13 03:24:59,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:24:59,178 INFO L369 hiAutomatonCegarLoop]: Abstraction has 68 states and 86 transitions. [2022-07-13 03:24:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 86 transitions. [2022-07-13 03:24:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-07-13 03:24:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 03:24:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2022-07-13 03:24:59,181 INFO L392 hiAutomatonCegarLoop]: Abstraction has 65 states and 81 transitions. [2022-07-13 03:24:59,181 INFO L374 stractBuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2022-07-13 03:24:59,181 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:24:59,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 81 transitions. [2022-07-13 03:24:59,182 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2022-07-13 03:24:59,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:59,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:59,183 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:59,183 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:59,183 INFO L752 eck$LassoCheckResult]: Stem: 819#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 804#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 805#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 807#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 808#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 840#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 837#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 836#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 810#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 809#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 792#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 835#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 802#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 791#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 801#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 803#L24 assume ~n#1 < 2; 823#merge_sortFINAL assume true; 817#merge_sortEXIT >#87#return; 790#L27-1 [2022-07-13 03:24:59,183 INFO L754 eck$LassoCheckResult]: Loop: 790#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 799#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 800#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 793#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 799#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 800#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 793#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 799#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 800#L24 assume ~n#1 < 2; 853#merge_sortFINAL assume true; 852#merge_sortEXIT >#87#return; 790#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 799#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 800#L24 assume ~n#1 < 2; 853#merge_sortFINAL assume true; 852#merge_sortEXIT >#89#return; 833#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 830#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 829#L11-4 merge_~i~0#1 := 0; 827#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 795#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 796#L8 assume { :end_inline_merge } true; 806#merge_sortFINAL assume true; 818#merge_sortEXIT >#87#return; 790#L27-1 [2022-07-13 03:24:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:59,184 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 2 times [2022-07-13 03:24:59,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:59,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506517824] [2022-07-13 03:24:59,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:59,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:59,193 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:59,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:59,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:59,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1010329933, now seen corresponding path program 1 times [2022-07-13 03:24:59,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:59,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475841954] [2022-07-13 03:24:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:59,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 03:24:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 03:24:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 03:24:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 03:24:59,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:59,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475841954] [2022-07-13 03:24:59,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475841954] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:24:59,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527160106] [2022-07-13 03:24:59,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:59,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:24:59,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:59,274 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:24:59,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-13 03:24:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:24:59,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 03:24:59,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:24:59,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527160106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:24:59,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 03:24:59,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-07-13 03:24:59,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318348901] [2022-07-13 03:24:59,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:24:59,369 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:24:59,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:59,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:24:59,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:24:59,369 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 03:24:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:24:59,399 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2022-07-13 03:24:59,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:24:59,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 103 transitions. [2022-07-13 03:24:59,401 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2022-07-13 03:24:59,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 103 transitions. [2022-07-13 03:24:59,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2022-07-13 03:24:59,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2022-07-13 03:24:59,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 103 transitions. [2022-07-13 03:24:59,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:24:59,403 INFO L369 hiAutomatonCegarLoop]: Abstraction has 81 states and 103 transitions. [2022-07-13 03:24:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 103 transitions. [2022-07-13 03:24:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2022-07-13 03:24:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 03:24:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2022-07-13 03:24:59,406 INFO L392 hiAutomatonCegarLoop]: Abstraction has 67 states and 83 transitions. [2022-07-13 03:24:59,406 INFO L374 stractBuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2022-07-13 03:24:59,406 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:24:59,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2022-07-13 03:24:59,406 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2022-07-13 03:24:59,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:59,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:59,407 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:59,407 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:59,407 INFO L752 eck$LassoCheckResult]: Stem: 1077#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1060#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1061#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 1063#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1064#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1065#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1066#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1095#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1094#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1093#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1047#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1092#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1058#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1045#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1057#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1059#L24 assume ~n#1 < 2; 1110#merge_sortFINAL assume true; 1105#merge_sortEXIT >#87#return; 1048#L27-1 [2022-07-13 03:24:59,407 INFO L754 eck$LassoCheckResult]: Loop: 1048#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1103#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1096#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1046#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1103#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1096#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1046#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1103#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1096#L24 assume ~n#1 < 2; 1097#merge_sortFINAL assume true; 1107#merge_sortEXIT >#87#return; 1048#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1103#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1096#L24 assume ~n#1 < 2; 1097#merge_sortFINAL assume true; 1107#merge_sortEXIT >#89#return; 1069#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 1070#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1067#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 1068#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 1091#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 1090#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 1089#L11-4 merge_~i~0#1 := 0; 1087#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 1050#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 1051#L8 assume { :end_inline_merge } true; 1062#merge_sortFINAL assume true; 1106#merge_sortEXIT >#87#return; 1048#L27-1 [2022-07-13 03:24:59,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 3 times [2022-07-13 03:24:59,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:59,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923165463] [2022-07-13 03:24:59,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:59,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:59,415 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:59,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:59,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1032888824, now seen corresponding path program 1 times [2022-07-13 03:24:59,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:59,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362739898] [2022-07-13 03:24:59,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:59,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 03:24:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 03:24:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 03:24:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 03:24:59,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:59,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362739898] [2022-07-13 03:24:59,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362739898] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:24:59,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657660851] [2022-07-13 03:24:59,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:59,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:24:59,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:59,484 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:24:59,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-13 03:24:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 03:24:59,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 03:24:59,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:24:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 03:24:59,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657660851] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:24:59,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:24:59,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-07-13 03:24:59,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414600533] [2022-07-13 03:24:59,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:24:59,669 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:24:59,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:59,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 03:24:59,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-13 03:24:59,670 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. cyclomatic complexity: 23 Second operand has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-13 03:24:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:24:59,912 INFO L93 Difference]: Finished difference Result 162 states and 216 transitions. [2022-07-13 03:24:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 03:24:59,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 216 transitions. [2022-07-13 03:24:59,914 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 89 [2022-07-13 03:24:59,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 216 transitions. [2022-07-13 03:24:59,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2022-07-13 03:24:59,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2022-07-13 03:24:59,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 216 transitions. [2022-07-13 03:24:59,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:24:59,916 INFO L369 hiAutomatonCegarLoop]: Abstraction has 162 states and 216 transitions. [2022-07-13 03:24:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 216 transitions. [2022-07-13 03:24:59,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 79. [2022-07-13 03:24:59,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 68 states have internal predecessors, (82), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 03:24:59,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2022-07-13 03:24:59,922 INFO L392 hiAutomatonCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-07-13 03:24:59,922 INFO L374 stractBuchiCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-07-13 03:24:59,922 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:24:59,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 97 transitions. [2022-07-13 03:24:59,922 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 36 [2022-07-13 03:24:59,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:59,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:59,923 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:59,923 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:59,923 INFO L752 eck$LassoCheckResult]: Stem: 1547#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1528#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1529#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 1531#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1532#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1533#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1534#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1558#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1535#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1536#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1513#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1555#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1523#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1514#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1522#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1524#L24 assume ~n#1 < 2; 1569#merge_sortFINAL assume true; 1564#merge_sortEXIT >#87#return; 1512#L27-1 [2022-07-13 03:24:59,923 INFO L754 eck$LassoCheckResult]: Loop: 1512#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1560#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1556#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1515#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1560#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1556#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1515#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1560#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1556#L24 assume ~n#1 < 2; 1557#merge_sortFINAL assume true; 1566#merge_sortEXIT >#87#return; 1512#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1560#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1556#L24 assume ~n#1 < 2; 1557#merge_sortFINAL assume true; 1566#merge_sortEXIT >#89#return; 1538#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 1539#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1537#L12 assume !(merge_~j~0#1 == merge_~n#1); 1525#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 1526#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 1587#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 1589#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 1588#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 1570#L11-4 merge_~i~0#1 := 0; 1567#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 1517#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 1518#L8 assume { :end_inline_merge } true; 1530#merge_sortFINAL assume true; 1565#merge_sortEXIT >#87#return; 1512#L27-1 [2022-07-13 03:24:59,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:59,924 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 4 times [2022-07-13 03:24:59,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:59,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266740071] [2022-07-13 03:24:59,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:59,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:59,931 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:59,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:59,937 INFO L85 PathProgramCache]: Analyzing trace with hash -245033989, now seen corresponding path program 1 times [2022-07-13 03:24:59,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:59,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498953614] [2022-07-13 03:24:59,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:59,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 03:24:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 03:24:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 03:24:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 03:24:59,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:59,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498953614] [2022-07-13 03:24:59,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498953614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:24:59,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:24:59,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 03:24:59,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297614673] [2022-07-13 03:24:59,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:24:59,995 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:24:59,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:59,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 03:24:59,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 03:24:59,996 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. cyclomatic complexity: 25 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 03:25:00,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:00,038 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-07-13 03:25:00,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:25:00,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 121 transitions. [2022-07-13 03:25:00,040 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 49 [2022-07-13 03:25:00,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 97 states and 121 transitions. [2022-07-13 03:25:00,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2022-07-13 03:25:00,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2022-07-13 03:25:00,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 121 transitions. [2022-07-13 03:25:00,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:25:00,041 INFO L369 hiAutomatonCegarLoop]: Abstraction has 97 states and 121 transitions. [2022-07-13 03:25:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 121 transitions. [2022-07-13 03:25:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-07-13 03:25:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 82 states have internal predecessors, (100), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 03:25:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2022-07-13 03:25:00,044 INFO L392 hiAutomatonCegarLoop]: Abstraction has 93 states and 115 transitions. [2022-07-13 03:25:00,044 INFO L374 stractBuchiCegarLoop]: Abstraction has 93 states and 115 transitions. [2022-07-13 03:25:00,044 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 03:25:00,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 115 transitions. [2022-07-13 03:25:00,045 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2022-07-13 03:25:00,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:00,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:00,049 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:00,049 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:00,049 INFO L752 eck$LassoCheckResult]: Stem: 1768#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1751#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1752#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 1754#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1755#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1756#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1757#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1785#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1786#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1787#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1736#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1782#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1746#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1737#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1745#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1747#L24 assume ~n#1 < 2; 1762#merge_sortFINAL assume true; 1763#merge_sortEXIT >#87#return; 1735#L27-1 [2022-07-13 03:25:00,050 INFO L754 eck$LassoCheckResult]: Loop: 1735#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1793#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1788#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1738#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1793#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1788#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1738#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1793#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1788#L24 assume ~n#1 < 2; 1789#merge_sortFINAL assume true; 1799#merge_sortEXIT >#87#return; 1735#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1793#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1788#L24 assume ~n#1 < 2; 1789#merge_sortFINAL assume true; 1799#merge_sortEXIT >#89#return; 1798#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 1769#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1770#L12 assume !(merge_~j~0#1 == merge_~n#1); 1815#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 1766#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 1734#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 1739#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 1826#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 1825#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 1824#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 1781#L11-4 merge_~i~0#1 := 0; 1779#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 1740#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 1741#L8 assume { :end_inline_merge } true; 1753#merge_sortFINAL assume true; 1797#merge_sortEXIT >#87#return; 1735#L27-1 [2022-07-13 03:25:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 5 times [2022-07-13 03:25:00,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:00,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574164798] [2022-07-13 03:25:00,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:00,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:00,061 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:00,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:00,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash 357057537, now seen corresponding path program 1 times [2022-07-13 03:25:00,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:00,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555770610] [2022-07-13 03:25:00,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:00,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 03:25:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:00,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 03:25:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:00,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 03:25:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 03:25:00,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:00,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555770610] [2022-07-13 03:25:00,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555770610] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:25:00,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882884777] [2022-07-13 03:25:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:00,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:25:00,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:00,136 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:25:00,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-13 03:25:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:00,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:25:00,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 03:25:00,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:25:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 03:25:00,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882884777] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:25:00,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:25:00,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-07-13 03:25:00,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264968357] [2022-07-13 03:25:00,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:25:00,292 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:25:00,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:25:00,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 03:25:00,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-13 03:25:00,292 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. cyclomatic complexity: 29 Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 03:25:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:00,559 INFO L93 Difference]: Finished difference Result 183 states and 223 transitions. [2022-07-13 03:25:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 03:25:00,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 223 transitions. [2022-07-13 03:25:00,562 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 65 [2022-07-13 03:25:00,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 183 states and 223 transitions. [2022-07-13 03:25:00,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-07-13 03:25:00,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-07-13 03:25:00,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 223 transitions. [2022-07-13 03:25:00,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:25:00,564 INFO L369 hiAutomatonCegarLoop]: Abstraction has 183 states and 223 transitions. [2022-07-13 03:25:00,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 223 transitions. [2022-07-13 03:25:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2022-07-13 03:25:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 106 states have (on average 1.1981132075471699) internal successors, (127), 107 states have internal predecessors, (127), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 03:25:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2022-07-13 03:25:00,568 INFO L392 hiAutomatonCegarLoop]: Abstraction has 118 states and 142 transitions. [2022-07-13 03:25:00,568 INFO L374 stractBuchiCegarLoop]: Abstraction has 118 states and 142 transitions. [2022-07-13 03:25:00,568 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-13 03:25:00,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 142 transitions. [2022-07-13 03:25:00,569 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2022-07-13 03:25:00,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:00,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:00,570 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:00,570 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:00,570 INFO L752 eck$LassoCheckResult]: Stem: 2303#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2284#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2285#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 2287#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2288#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2289#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2290#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2321#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2320#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2319#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 2270#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2318#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2280#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2271#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2279#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2281#L24 assume ~n#1 < 2; 2336#merge_sortFINAL assume true; 2332#merge_sortEXIT >#87#return; 2269#L27-1 [2022-07-13 03:25:00,570 INFO L754 eck$LassoCheckResult]: Loop: 2269#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2328#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2325#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2272#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2328#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2325#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2272#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2328#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2325#L24 assume ~n#1 < 2; 2326#merge_sortFINAL assume true; 2335#merge_sortEXIT >#87#return; 2269#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2328#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2325#L24 assume ~n#1 < 2; 2326#merge_sortFINAL assume true; 2335#merge_sortEXIT >#89#return; 2334#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 2360#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 2359#L12 assume !(merge_~j~0#1 == merge_~n#1); 2358#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 2356#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 2355#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 2354#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 2353#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 2351#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 2350#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 2344#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 2345#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 2385#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 2384#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 2323#L11-4 merge_~i~0#1 := 0; 2322#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 2317#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 2316#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 2274#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 2275#L8 assume { :end_inline_merge } true; 2286#merge_sortFINAL assume true; 2333#merge_sortEXIT >#87#return; 2269#L27-1 [2022-07-13 03:25:00,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 6 times [2022-07-13 03:25:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:00,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358217499] [2022-07-13 03:25:00,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:00,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:00,577 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:00,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:00,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:00,582 INFO L85 PathProgramCache]: Analyzing trace with hash 413165114, now seen corresponding path program 1 times [2022-07-13 03:25:00,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:00,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301174550] [2022-07-13 03:25:00,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:00,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:00,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 03:25:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:00,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 03:25:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:00,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 03:25:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 03:25:00,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:00,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301174550] [2022-07-13 03:25:00,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301174550] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:25:00,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006672916] [2022-07-13 03:25:00,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:00,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:25:00,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:00,690 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:25:00,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-13 03:25:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:00,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:25:00,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 03:25:00,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:25:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 03:25:00,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006672916] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:25:00,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:25:00,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2022-07-13 03:25:00,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137933290] [2022-07-13 03:25:00,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:25:00,834 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:25:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:25:00,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 03:25:00,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-13 03:25:00,834 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. cyclomatic complexity: 31 Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 03:25:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:01,064 INFO L93 Difference]: Finished difference Result 227 states and 287 transitions. [2022-07-13 03:25:01,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 03:25:01,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 287 transitions. [2022-07-13 03:25:01,067 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 113 [2022-07-13 03:25:01,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 227 states and 287 transitions. [2022-07-13 03:25:01,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2022-07-13 03:25:01,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 218 [2022-07-13 03:25:01,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 287 transitions. [2022-07-13 03:25:01,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:25:01,069 INFO L369 hiAutomatonCegarLoop]: Abstraction has 227 states and 287 transitions. [2022-07-13 03:25:01,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 287 transitions. [2022-07-13 03:25:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 120. [2022-07-13 03:25:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 109 states have internal predecessors, (129), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 03:25:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 144 transitions. [2022-07-13 03:25:01,073 INFO L392 hiAutomatonCegarLoop]: Abstraction has 120 states and 144 transitions. [2022-07-13 03:25:01,073 INFO L374 stractBuchiCegarLoop]: Abstraction has 120 states and 144 transitions. [2022-07-13 03:25:01,073 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-13 03:25:01,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 144 transitions. [2022-07-13 03:25:01,073 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2022-07-13 03:25:01,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:01,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:01,074 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:01,074 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:01,074 INFO L752 eck$LassoCheckResult]: Stem: 2947#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2931#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2932#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 2934#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2935#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2936#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2937#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2963#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2964#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2965#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 2920#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2960#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2927#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2921#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2926#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2928#L24 assume ~n#1 < 2; 2974#merge_sortFINAL assume true; 2970#merge_sortEXIT >#87#return; 2918#L27-1 [2022-07-13 03:25:01,074 INFO L754 eck$LassoCheckResult]: Loop: 2918#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2968#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2966#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2919#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2968#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2966#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2919#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2968#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2966#L24 assume ~n#1 < 2; 2967#merge_sortFINAL assume true; 2973#merge_sortEXIT >#87#return; 2918#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2968#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2966#L24 assume ~n#1 < 2; 2967#merge_sortFINAL assume true; 2973#merge_sortEXIT >#89#return; 2972#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 2999#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 3000#L12 assume !(merge_~j~0#1 == merge_~n#1); 2995#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 2996#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 3006#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 3005#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 3004#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 3003#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 3002#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 3001#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 2989#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 3017#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 3016#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 2978#L11-4 merge_~i~0#1 := 0; 2977#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 2976#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 2975#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 2962#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 2961#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 2917#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 2922#L8 assume { :end_inline_merge } true; 2933#merge_sortFINAL assume true; 2971#merge_sortEXIT >#87#return; 2918#L27-1 [2022-07-13 03:25:01,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 7 times [2022-07-13 03:25:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:01,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947029544] [2022-07-13 03:25:01,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:01,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:01,090 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:01,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash -729143752, now seen corresponding path program 2 times [2022-07-13 03:25:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:01,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188134664] [2022-07-13 03:25:01,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:01,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:01,139 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:01,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:01,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:01,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1690449871, now seen corresponding path program 1 times [2022-07-13 03:25:01,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:01,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801131997] [2022-07-13 03:25:01,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:01,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:01,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 03:25:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:01,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 03:25:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:01,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 03:25:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 03:25:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 03:25:01,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:01,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801131997] [2022-07-13 03:25:01,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801131997] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:25:01,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815398250] [2022-07-13 03:25:01,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:01,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:25:01,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:01,408 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:25:01,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-13 03:25:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:01,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 03:25:01,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 03:25:01,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:25:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 03:25:01,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815398250] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:25:01,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:25:01,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 27 [2022-07-13 03:25:01,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883393247] [2022-07-13 03:25:01,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:25:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:25:05,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-13 03:25:05,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2022-07-13 03:25:05,703 INFO L87 Difference]: Start difference. First operand 120 states and 144 transitions. cyclomatic complexity: 31 Second operand has 28 states, 21 states have (on average 2.761904761904762) internal successors, (58), 23 states have internal predecessors, (58), 8 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-13 03:25:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:06,383 INFO L93 Difference]: Finished difference Result 337 states and 420 transitions. [2022-07-13 03:25:06,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-13 03:25:06,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 420 transitions. [2022-07-13 03:25:06,387 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 141 [2022-07-13 03:25:06,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 333 states and 416 transitions. [2022-07-13 03:25:06,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2022-07-13 03:25:06,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2022-07-13 03:25:06,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 333 states and 416 transitions. [2022-07-13 03:25:06,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:25:06,392 INFO L369 hiAutomatonCegarLoop]: Abstraction has 333 states and 416 transitions. [2022-07-13 03:25:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states and 416 transitions. [2022-07-13 03:25:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 238. [2022-07-13 03:25:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 214 states have (on average 1.2149532710280373) internal successors, (260), 217 states have internal predecessors, (260), 17 states have call successors, (17), 11 states have call predecessors, (17), 7 states have return successors, (19), 9 states have call predecessors, (19), 13 states have call successors, (19) [2022-07-13 03:25:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 296 transitions. [2022-07-13 03:25:06,405 INFO L392 hiAutomatonCegarLoop]: Abstraction has 238 states and 296 transitions. [2022-07-13 03:25:06,405 INFO L374 stractBuchiCegarLoop]: Abstraction has 238 states and 296 transitions. [2022-07-13 03:25:06,405 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-13 03:25:06,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 238 states and 296 transitions. [2022-07-13 03:25:06,406 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 96 [2022-07-13 03:25:06,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:06,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:06,408 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:06,409 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:25:06,410 INFO L752 eck$LassoCheckResult]: Stem: 3887#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3860#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 3861#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 3868#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 3869#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 3911#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 3910#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 3908#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 3909#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 3945#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 3884#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 3902#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3903#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 3857#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3855#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3858#L24 assume ~n#1 < 2; 3939#merge_sortFINAL assume true; 3936#merge_sortEXIT >#87#return; 3866#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 3883#merge_sortENTRY [2022-07-13 03:25:06,410 INFO L754 eck$LassoCheckResult]: Loop: 3883#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3906#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 3865#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3883#merge_sortENTRY [2022-07-13 03:25:06,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:06,410 INFO L85 PathProgramCache]: Analyzing trace with hash 313135262, now seen corresponding path program 2 times [2022-07-13 03:25:06,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:06,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61360722] [2022-07-13 03:25:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:06,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:06,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:06,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:06,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:06,435 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 4 times [2022-07-13 03:25:06,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:06,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730924621] [2022-07-13 03:25:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:06,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:06,442 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:06,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:06,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:06,445 INFO L85 PathProgramCache]: Analyzing trace with hash -56376460, now seen corresponding path program 3 times [2022-07-13 03:25:06,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:06,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135504107] [2022-07-13 03:25:06,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:06,470 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:06,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:07,302 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:25:07,302 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:25:07,302 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:25:07,302 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:25:07,302 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:25:07,302 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:07,302 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:25:07,302 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:25:07,302 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration12_Lasso [2022-07-13 03:25:07,302 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:25:07,302 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:25:07,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,685 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:25:07,685 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:25:07,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:07,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:07,692 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:07,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-13 03:25:07,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:07,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:07,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:07,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:07,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:07,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:07,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:07,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:07,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:07,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:07,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:07,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:07,731 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:07,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-13 03:25:07,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:07,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:07,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:07,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:07,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:07,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:07,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:07,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:07,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:07,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-13 03:25:07,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:07,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:07,763 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:07,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-13 03:25:07,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:07,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:07,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:07,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:07,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:07,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:07,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:07,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:07,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:07,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:07,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:07,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:07,797 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:07,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-13 03:25:07,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:07,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:07,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:07,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:07,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:07,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:07,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:07,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:07,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:07,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-13 03:25:07,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:07,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:07,838 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:07,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-13 03:25:07,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:07,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:07,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:07,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:07,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:07,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:07,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:07,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:07,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:07,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-13 03:25:07,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:07,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:07,868 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:07,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-13 03:25:07,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:07,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:07,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:07,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:07,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:07,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:07,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:07,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:07,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:07,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:07,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:07,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:07,896 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:07,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-13 03:25:07,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:07,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:07,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:07,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:07,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:07,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:07,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:07,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:07,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:07,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:07,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:07,924 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:07,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-13 03:25:07,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:07,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:07,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:07,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:07,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:07,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:07,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:07,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:07,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:07,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-13 03:25:07,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:07,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:07,968 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:07,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-13 03:25:07,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:07,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:07,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:07,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:07,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:07,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:07,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:07,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:07,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-13 03:25:08,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,008 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-13 03:25:08,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,045 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-13 03:25:08,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,079 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-13 03:25:08,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,109 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-13 03:25:08,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-13 03:25:08,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,139 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-13 03:25:08,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-13 03:25:08,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,170 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-13 03:25:08,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,195 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-13 03:25:08,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-13 03:25:08,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,222 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-13 03:25:08,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-13 03:25:08,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,256 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-13 03:25:08,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,286 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-13 03:25:08,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,312 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-13 03:25:08,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,338 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-13 03:25:08,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-13 03:25:08,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,369 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-13 03:25:08,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,394 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-13 03:25:08,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,419 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-13 03:25:08,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-13 03:25:08,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,458 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-13 03:25:08,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,484 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-13 03:25:08,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,492 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-13 03:25:08,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,508 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-13 03:25:08,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-13 03:25:08,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,533 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-13 03:25:08,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-13 03:25:08,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,557 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-13 03:25:08,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-13 03:25:08,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,588 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-13 03:25:08,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-07-13 03:25:08,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,613 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-13 03:25:08,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-13 03:25:08,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,639 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-13 03:25:08,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:08,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:08,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-13 03:25:08,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,667 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-13 03:25:08,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,698 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-13 03:25:08,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-13 03:25:08,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,723 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-13 03:25:08,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-07-13 03:25:08,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,748 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-13 03:25:08,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:08,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:08,767 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:25:08,779 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-13 03:25:08,779 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-13 03:25:08,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,781 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-13 03:25:08,809 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:25:08,816 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:25:08,816 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:25:08,816 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n#1) = 1*merge_sort_#in~n#1 Supporting invariants [] [2022-07-13 03:25:08,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,834 INFO L293 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-07-13 03:25:08,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:08,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 03:25:08,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:08,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 03:25:08,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:25:08,960 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-07-13 03:25:08,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 238 states and 296 transitions. cyclomatic complexity: 71 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 03:25:09,021 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 238 states and 296 transitions. cyclomatic complexity: 71. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 281 states and 363 transitions. Complement of second has 14 states. [2022-07-13 03:25:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 03:25:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 03:25:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-07-13 03:25:09,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 3 letters. [2022-07-13 03:25:09,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:25:09,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 22 letters. Loop has 3 letters. [2022-07-13 03:25:09,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:25:09,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 6 letters. [2022-07-13 03:25:09,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:25:09,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 363 transitions. [2022-07-13 03:25:09,037 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 96 [2022-07-13 03:25:09,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 269 states and 348 transitions. [2022-07-13 03:25:09,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2022-07-13 03:25:09,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2022-07-13 03:25:09,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 269 states and 348 transitions. [2022-07-13 03:25:09,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:25:09,042 INFO L369 hiAutomatonCegarLoop]: Abstraction has 269 states and 348 transitions. [2022-07-13 03:25:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states and 348 transitions. [2022-07-13 03:25:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 259. [2022-07-13 03:25:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 226 states have (on average 1.2256637168141593) internal successors, (277), 229 states have internal predecessors, (277), 24 states have call successors, (24), 16 states have call predecessors, (24), 9 states have return successors, (30), 13 states have call predecessors, (30), 20 states have call successors, (30) [2022-07-13 03:25:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 331 transitions. [2022-07-13 03:25:09,053 INFO L392 hiAutomatonCegarLoop]: Abstraction has 259 states and 331 transitions. [2022-07-13 03:25:09,053 INFO L374 stractBuchiCegarLoop]: Abstraction has 259 states and 331 transitions. [2022-07-13 03:25:09,053 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-13 03:25:09,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 331 transitions. [2022-07-13 03:25:09,054 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 96 [2022-07-13 03:25:09,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:09,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:09,056 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:09,056 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:09,056 INFO L752 eck$LassoCheckResult]: Stem: 4520#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4495#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4496#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 4502#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 4503#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4622#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 4618#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4616#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 4611#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4606#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 4498#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 4604#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4600#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 4477#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4517#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4631#L24 assume ~n#1 < 2; 4630#merge_sortFINAL assume true; 4594#merge_sortEXIT >#87#return; 4475#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 4526#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4491#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 4468#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4490#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4492#L24 assume ~n#1 < 2; 4596#merge_sortFINAL assume true; 4590#merge_sortEXIT >#87#return; 4476#L27-1 [2022-07-13 03:25:09,056 INFO L754 eck$LassoCheckResult]: Loop: 4476#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 4592#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4632#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 4472#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4592#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4632#L24 assume ~n#1 < 2; 4543#merge_sortFINAL assume true; 4588#merge_sortEXIT >#87#return; 4476#L27-1 [2022-07-13 03:25:09,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:09,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1251148749, now seen corresponding path program 4 times [2022-07-13 03:25:09,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:09,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145634293] [2022-07-13 03:25:09,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:09,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:09,108 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:09,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:09,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:09,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1429943866, now seen corresponding path program 2 times [2022-07-13 03:25:09,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:09,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878317826] [2022-07-13 03:25:09,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:09,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:09,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:09,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:09,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:09,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash 826925164, now seen corresponding path program 5 times [2022-07-13 03:25:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:09,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990172089] [2022-07-13 03:25:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:09,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 03:25:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:09,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 03:25:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:09,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 03:25:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 03:25:09,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:09,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990172089] [2022-07-13 03:25:09,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990172089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:25:09,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346888132] [2022-07-13 03:25:09,317 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 03:25:09,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:25:09,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:09,328 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:25:09,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-07-13 03:25:09,384 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 03:25:09,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:25:09,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 03:25:09,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 03:25:09,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:25:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 03:25:09,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346888132] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:25:09,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:25:09,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 24 [2022-07-13 03:25:09,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424754396] [2022-07-13 03:25:09,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:25:09,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:25:09,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 03:25:09,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-07-13 03:25:09,910 INFO L87 Difference]: Start difference. First operand 259 states and 331 transitions. cyclomatic complexity: 87 Second operand has 24 states, 15 states have (on average 2.4) internal successors, (36), 19 states have internal predecessors, (36), 11 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-13 03:25:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:10,421 INFO L93 Difference]: Finished difference Result 651 states and 815 transitions. [2022-07-13 03:25:10,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 03:25:10,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 651 states and 815 transitions. [2022-07-13 03:25:10,432 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 293 [2022-07-13 03:25:10,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 651 states to 648 states and 812 transitions. [2022-07-13 03:25:10,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 618 [2022-07-13 03:25:10,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 629 [2022-07-13 03:25:10,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 648 states and 812 transitions. [2022-07-13 03:25:10,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:25:10,442 INFO L369 hiAutomatonCegarLoop]: Abstraction has 648 states and 812 transitions. [2022-07-13 03:25:10,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states and 812 transitions. [2022-07-13 03:25:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 357. [2022-07-13 03:25:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 318 states have (on average 1.2138364779874213) internal successors, (386), 320 states have internal predecessors, (386), 28 states have call successors, (28), 18 states have call predecessors, (28), 11 states have return successors, (39), 18 states have call predecessors, (39), 24 states have call successors, (39) [2022-07-13 03:25:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 453 transitions. [2022-07-13 03:25:10,460 INFO L392 hiAutomatonCegarLoop]: Abstraction has 357 states and 453 transitions. [2022-07-13 03:25:10,460 INFO L374 stractBuchiCegarLoop]: Abstraction has 357 states and 453 transitions. [2022-07-13 03:25:10,460 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-13 03:25:10,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 357 states and 453 transitions. [2022-07-13 03:25:10,462 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 139 [2022-07-13 03:25:10,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:10,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:10,465 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:10,465 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:10,465 INFO L752 eck$LassoCheckResult]: Stem: 5695#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5674#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 5675#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 5680#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 5681#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 5682#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 5683#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 5716#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 5658#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 5707#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5772#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 5726#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 5730#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5748#L24 assume ~n#1 < 2; 5749#merge_sortFINAL assume true; 5725#merge_sortEXIT >#87#return; 5699#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 5700#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5701#L24 assume ~n#1 < 2; 5702#merge_sortFINAL assume true; 5905#merge_sortEXIT >#89#return; 5688#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 5689#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6001#L12 assume !(merge_~j~0#1 == merge_~n#1); 5667#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 5668#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 5998#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 5996#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 5997#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 6006#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 6004#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6002#L12 [2022-07-13 03:25:10,465 INFO L754 eck$LassoCheckResult]: Loop: 6002#L12 assume !(merge_~j~0#1 == merge_~n#1); 6000#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 5693#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 5694#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6008#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 6007#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 6005#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 6003#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6002#L12 [2022-07-13 03:25:10,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:10,466 INFO L85 PathProgramCache]: Analyzing trace with hash 309875929, now seen corresponding path program 1 times [2022-07-13 03:25:10,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:10,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562044842] [2022-07-13 03:25:10,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:10,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:10,483 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:10,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:10,501 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times [2022-07-13 03:25:10,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:10,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816484948] [2022-07-13 03:25:10,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:10,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:10,509 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:10,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:10,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1231791987, now seen corresponding path program 2 times [2022-07-13 03:25:10,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:10,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023725639] [2022-07-13 03:25:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:10,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 03:25:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:10,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 03:25:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 03:25:10,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:10,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023725639] [2022-07-13 03:25:10,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023725639] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:25:10,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714297814] [2022-07-13 03:25:10,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:25:10,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:25:10,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:10,605 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:25:10,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-07-13 03:25:10,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 03:25:10,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:25:10,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 03:25:10,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 03:25:10,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:25:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 03:25:10,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714297814] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:25:10,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:25:10,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-07-13 03:25:10,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381680452] [2022-07-13 03:25:10,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:25:10,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:25:10,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 03:25:10,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-07-13 03:25:10,999 INFO L87 Difference]: Start difference. First operand 357 states and 453 transitions. cyclomatic complexity: 112 Second operand has 17 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 03:25:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:11,210 INFO L93 Difference]: Finished difference Result 395 states and 495 transitions. [2022-07-13 03:25:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 03:25:11,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 395 states and 495 transitions. [2022-07-13 03:25:11,221 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 141 [2022-07-13 03:25:11,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 395 states to 395 states and 495 transitions. [2022-07-13 03:25:11,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2022-07-13 03:25:11,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 376 [2022-07-13 03:25:11,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 395 states and 495 transitions. [2022-07-13 03:25:11,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:25:11,226 INFO L369 hiAutomatonCegarLoop]: Abstraction has 395 states and 495 transitions. [2022-07-13 03:25:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states and 495 transitions. [2022-07-13 03:25:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 382. [2022-07-13 03:25:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 343 states have (on average 1.2099125364431487) internal successors, (415), 344 states have internal predecessors, (415), 28 states have call successors, (28), 18 states have call predecessors, (28), 11 states have return successors, (39), 19 states have call predecessors, (39), 24 states have call successors, (39) [2022-07-13 03:25:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 482 transitions. [2022-07-13 03:25:11,234 INFO L392 hiAutomatonCegarLoop]: Abstraction has 382 states and 482 transitions. [2022-07-13 03:25:11,234 INFO L374 stractBuchiCegarLoop]: Abstraction has 382 states and 482 transitions. [2022-07-13 03:25:11,234 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-13 03:25:11,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 382 states and 482 transitions. [2022-07-13 03:25:11,236 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 139 [2022-07-13 03:25:11,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:11,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:11,237 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:11,237 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:11,237 INFO L752 eck$LassoCheckResult]: Stem: 6724#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6701#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 6702#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 6704#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 6705#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 6706#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 6707#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 6750#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 6751#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 6746#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 6691#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 6740#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6865#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 6858#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6859#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6697#L24 assume ~n#1 < 2; 6863#merge_sortFINAL assume true; 6857#merge_sortEXIT >#87#return; 6714#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 6836#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6875#L24 assume ~n#1 < 2; 6872#merge_sortFINAL assume true; 6867#merge_sortEXIT >#89#return; 6855#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 6969#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6967#L12 assume !(merge_~j~0#1 == merge_~n#1); 6965#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 6963#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 6960#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6958#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 6956#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 6954#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 6952#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6950#L12 [2022-07-13 03:25:11,237 INFO L754 eck$LassoCheckResult]: Loop: 6950#L12 assume !(merge_~j~0#1 == merge_~n#1); 6951#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 6961#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 6962#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6948#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 6949#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 6907#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 6908#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6950#L12 [2022-07-13 03:25:11,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2045280059, now seen corresponding path program 3 times [2022-07-13 03:25:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:11,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226445551] [2022-07-13 03:25:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:11,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 03:25:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:11,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 03:25:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 03:25:11,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:11,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226445551] [2022-07-13 03:25:11,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226445551] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:25:11,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910624533] [2022-07-13 03:25:11,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 03:25:11,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:25:11,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:11,312 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:25:11,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-07-13 03:25:11,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 03:25:11,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:25:11,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 03:25:11,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 03:25:11,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:25:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 03:25:11,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910624533] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:25:11,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:25:11,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 16 [2022-07-13 03:25:11,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759930594] [2022-07-13 03:25:11,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:25:11,498 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:25:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:11,499 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2022-07-13 03:25:11,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:11,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121626628] [2022-07-13 03:25:11,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:11,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:11,503 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:11,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:25:11,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 03:25:11,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-13 03:25:11,652 INFO L87 Difference]: Start difference. First operand 382 states and 482 transitions. cyclomatic complexity: 116 Second operand has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 03:25:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:11,896 INFO L93 Difference]: Finished difference Result 562 states and 697 transitions. [2022-07-13 03:25:11,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 03:25:11,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 697 transitions. [2022-07-13 03:25:11,901 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 229 [2022-07-13 03:25:11,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 550 states and 685 transitions. [2022-07-13 03:25:11,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 529 [2022-07-13 03:25:11,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 529 [2022-07-13 03:25:11,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 550 states and 685 transitions. [2022-07-13 03:25:11,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:25:11,905 INFO L369 hiAutomatonCegarLoop]: Abstraction has 550 states and 685 transitions. [2022-07-13 03:25:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states and 685 transitions. [2022-07-13 03:25:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 386. [2022-07-13 03:25:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 344 states have (on average 1.2093023255813953) internal successors, (416), 346 states have internal predecessors, (416), 31 states have call successors, (31), 18 states have call predecessors, (31), 11 states have return successors, (42), 21 states have call predecessors, (42), 27 states have call successors, (42) [2022-07-13 03:25:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 489 transitions. [2022-07-13 03:25:11,913 INFO L392 hiAutomatonCegarLoop]: Abstraction has 386 states and 489 transitions. [2022-07-13 03:25:11,913 INFO L374 stractBuchiCegarLoop]: Abstraction has 386 states and 489 transitions. [2022-07-13 03:25:11,913 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-13 03:25:11,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 489 transitions. [2022-07-13 03:25:11,915 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 139 [2022-07-13 03:25:11,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:11,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:11,915 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:11,916 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:25:11,916 INFO L752 eck$LassoCheckResult]: Stem: 7907#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7885#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 7886#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 7888#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 7889#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 7890#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 7891#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 7925#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 7903#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 7915#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7944#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 7902#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 7904#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8013#L24 assume ~n#1 < 2; 8012#merge_sortFINAL assume true; 8011#merge_sortEXIT >#87#return; 7875#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 7874#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7876#L24 assume ~n#1 < 2; 7911#merge_sortFINAL assume true; 7896#merge_sortEXIT >#89#return; 7897#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 8239#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 8238#L12 assume !(merge_~j~0#1 == merge_~n#1); 8237#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 8236#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 8234#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 8232#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 8230#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 8228#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 8226#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 8223#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 8224#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 8205#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 7943#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 7914#L11-4 merge_~i~0#1 := 0; 7910#L17-3 [2022-07-13 03:25:11,916 INFO L754 eck$LassoCheckResult]: Loop: 7910#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 7909#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 7910#L17-3 [2022-07-13 03:25:11,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2097782888, now seen corresponding path program 1 times [2022-07-13 03:25:11,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:11,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899199955] [2022-07-13 03:25:11,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:11,928 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:11,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:11,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:11,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2022-07-13 03:25:11,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:11,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924963376] [2022-07-13 03:25:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:11,942 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:11,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:11,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1629691942, now seen corresponding path program 1 times [2022-07-13 03:25:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:11,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062306669] [2022-07-13 03:25:11,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:11,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:11,958 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:11,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:14,140 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:25:14,140 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:25:14,140 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:25:14,140 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:25:14,140 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:25:14,140 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:14,140 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:25:14,140 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:25:14,140 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration16_Lasso [2022-07-13 03:25:14,140 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:25:14,140 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:25:14,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:14,340 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:109) 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-13 03:25:14,344 INFO L158 Benchmark]: Toolchain (without parser) took 20360.80ms. Allocated memory was 98.6MB in the beginning and 201.3MB in the end (delta: 102.8MB). Free memory was 64.6MB in the beginning and 64.7MB in the end (delta: -149.6kB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. [2022-07-13 03:25:14,344 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 98.6MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:25:14,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.22ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 73.1MB in the end (delta: -8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:25:14,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.43ms. Allocated memory is still 98.6MB. Free memory was 73.1MB in the beginning and 71.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:25:14,344 INFO L158 Benchmark]: Boogie Preprocessor took 39.83ms. Allocated memory is still 98.6MB. Free memory was 71.2MB in the beginning and 70.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:25:14,345 INFO L158 Benchmark]: RCFGBuilder took 372.04ms. Allocated memory is still 98.6MB. Free memory was 70.0MB in the beginning and 57.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 03:25:14,345 INFO L158 Benchmark]: BuchiAutomizer took 19755.44ms. Allocated memory was 98.6MB in the beginning and 201.3MB in the end (delta: 102.8MB). Free memory was 57.7MB in the beginning and 64.7MB in the end (delta: -7.0MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. [2022-07-13 03:25:14,346 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.12ms. Allocated memory is still 98.6MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.22ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 73.1MB in the end (delta: -8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.43ms. Allocated memory is still 98.6MB. Free memory was 73.1MB in the beginning and 71.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.83ms. Allocated memory is still 98.6MB. Free memory was 71.2MB in the beginning and 70.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.04ms. Allocated memory is still 98.6MB. Free memory was 70.0MB in the beginning and 57.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 19755.44ms. Allocated memory was 98.6MB in the beginning and 201.3MB in the end (delta: 102.8MB). Free memory was 57.7MB in the beginning and 64.7MB in the end (delta: -7.0MB). Peak memory consumption was 112.9MB. 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-13 03:25:14,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-07-13 03:25:14,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2022-07-13 03:25:14,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-07-13 03:25:14,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-07-13 03:25:15,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-07-13 03:25:15,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:15,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-07-13 03:25:15,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:15,982 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-13 03:25:16,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-13 03:25:16,370 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*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null