./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-19 17:46:38,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 17:46:38,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 17:46:38,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 17:46:38,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 17:46:38,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 17:46:38,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 17:46:38,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 17:46:38,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 17:46:38,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 17:46:38,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 17:46:38,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 17:46:38,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 17:46:38,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 17:46:38,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 17:46:38,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 17:46:38,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 17:46:38,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 17:46:38,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 17:46:38,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 17:46:38,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 17:46:38,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 17:46:38,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 17:46:38,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 17:46:38,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 17:46:38,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 17:46:38,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 17:46:38,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 17:46:38,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 17:46:38,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 17:46:38,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 17:46:38,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 17:46:38,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 17:46:38,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 17:46:38,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 17:46:38,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 17:46:38,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 17:46:38,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 17:46:38,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 17:46:38,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 17:46:38,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 17:46:38,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-19 17:46:39,020 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 17:46:39,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 17:46:39,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 17:46:39,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 17:46:39,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 17:46:39,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 17:46:39,022 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 17:46:39,022 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 17:46:39,023 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 17:46:39,023 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 17:46:39,023 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 17:46:39,024 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 17:46:39,024 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 17:46:39,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 17:46:39,024 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 17:46:39,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 17:46:39,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 17:46:39,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 17:46:39,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 17:46:39,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 17:46:39,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 17:46:39,025 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 17:46:39,025 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 17:46:39,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 17:46:39,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 17:46:39,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 17:46:39,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 17:46:39,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 17:46:39,027 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 17:46:39,028 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 17:46:39,029 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 [2021-12-19 17:46:39,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 17:46:39,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 17:46:39,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 17:46:39,217 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 17:46:39,219 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 17:46:39,220 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2021-12-19 17:46:39,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f8f44bb/9f660ba4ec814ecba084990fece12aec/FLAG0ce78714b [2021-12-19 17:46:39,586 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 17:46:39,587 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2021-12-19 17:46:39,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f8f44bb/9f660ba4ec814ecba084990fece12aec/FLAG0ce78714b [2021-12-19 17:46:40,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f8f44bb/9f660ba4ec814ecba084990fece12aec [2021-12-19 17:46:40,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 17:46:40,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 17:46:40,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 17:46:40,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 17:46:40,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 17:46:40,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:46:40" (1/1) ... [2021-12-19 17:46:40,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505bc686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:46:40, skipping insertion in model container [2021-12-19 17:46:40,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:46:40" (1/1) ... [2021-12-19 17:46:40,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 17:46:40,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 17:46:40,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:46:40,222 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 17:46:40,234 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:46:40,244 INFO L208 MainTranslator]: Completed translation [2021-12-19 17:46:40,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:46:40 WrapperNode [2021-12-19 17:46:40,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 17:46:40,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 17:46:40,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 17:46:40,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 17:46:40,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:46:40" (1/1) ... [2021-12-19 17:46:40,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:46:40" (1/1) ... [2021-12-19 17:46:40,289 INFO L137 Inliner]: procedures = 12, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2021-12-19 17:46:40,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 17:46:40,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 17:46:40,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 17:46:40,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 17:46:40,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:46:40" (1/1) ... [2021-12-19 17:46:40,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:46:40" (1/1) ... [2021-12-19 17:46:40,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:46:40" (1/1) ... [2021-12-19 17:46:40,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:46:40" (1/1) ... [2021-12-19 17:46:40,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:46:40" (1/1) ... [2021-12-19 17:46:40,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:46:40" (1/1) ... [2021-12-19 17:46:40,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:46:40" (1/1) ... [2021-12-19 17:46:40,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 17:46:40,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 17:46:40,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 17:46:40,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 17:46:40,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:46:40" (1/1) ... [2021-12-19 17:46:40,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:40,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:40,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:40,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-19 17:46:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-19 17:46:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2021-12-19 17:46:40,381 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2021-12-19 17:46:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-19 17:46:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 17:46:40,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 17:46:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-19 17:46:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 17:46:40,429 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 17:46:40,430 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 17:46:40,596 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 17:46:40,602 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 17:46:40,611 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-19 17:46:40,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:46:40 BoogieIcfgContainer [2021-12-19 17:46:40,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 17:46:40,613 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 17:46:40,613 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 17:46:40,616 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 17:46:40,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:46:40,618 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 05:46:40" (1/3) ... [2021-12-19 17:46:40,618 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60f1912e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:46:40, skipping insertion in model container [2021-12-19 17:46:40,619 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:46:40,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:46:40" (2/3) ... [2021-12-19 17:46:40,619 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60f1912e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:46:40, skipping insertion in model container [2021-12-19 17:46:40,619 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:46:40,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:46:40" (3/3) ... [2021-12-19 17:46:40,620 INFO L388 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2021-12-19 17:46:40,649 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 17:46:40,649 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 17:46:40,649 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 17:46:40,650 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 17:46:40,650 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 17:46:40,650 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 17:46:40,650 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 17:46:40,650 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 17:46:40,659 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) [2021-12-19 17:46:40,674 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-19 17:46:40,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:46:40,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:46:40,679 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-19 17:46:40,680 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:46:40,680 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 17:46:40,680 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) [2021-12-19 17:46:40,683 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-19 17:46:40,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:46:40,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:46:40,683 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-19 17:46:40,684 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:46:40,688 INFO L791 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#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; 17#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; 11#L40-3true [2021-12-19 17:46:40,689 INFO L793 eck$LassoCheckResult]: Loop: 11#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; 12#L40-2true main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 11#L40-3true [2021-12-19 17:46:40,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:40,693 INFO L85 PathProgramCache]: Analyzing trace with hash 89440, now seen corresponding path program 1 times [2021-12-19 17:46:40,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:40,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670076317] [2021-12-19 17:46:40,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:40,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:40,759 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:40,794 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:40,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:40,796 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2021-12-19 17:46:40,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:40,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520275353] [2021-12-19 17:46:40,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:40,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:40,816 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:40,832 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:40,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:40,833 INFO L85 PathProgramCache]: Analyzing trace with hash 85954242, now seen corresponding path program 1 times [2021-12-19 17:46:40,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:40,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319793671] [2021-12-19 17:46:40,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:40,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:40,868 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:40,877 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:41,088 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:46:41,089 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:46:41,089 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:46:41,089 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:46:41,089 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:46:41,089 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:41,089 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:46:41,090 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:46:41,090 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2021-12-19 17:46:41,090 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:46:41,090 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:46:41,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:41,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:41,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:41,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:41,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:41,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:41,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:41,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:41,285 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:46:41,287 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:46:41,289 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:41,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:41,291 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) [2021-12-19 17:46:41,298 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 [2021-12-19 17:46:41,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:41,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:41,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:41,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:41,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:41,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:41,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:41,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:41,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:41,342 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 [2021-12-19 17:46:41,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:41,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:41,343 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) [2021-12-19 17:46:41,344 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 [2021-12-19 17:46:41,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:41,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:41,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:41,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:41,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:41,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:41,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:41,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:41,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-19 17:46:41,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:41,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:41,387 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) [2021-12-19 17:46:41,388 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 [2021-12-19 17:46:41,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:41,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:41,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:41,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:41,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:41,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:41,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:41,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:41,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:41,415 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 [2021-12-19 17:46:41,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:41,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:41,416 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) [2021-12-19 17:46:41,417 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 [2021-12-19 17:46:41,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:41,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:41,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:41,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:41,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:41,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:41,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:41,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:41,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:41,450 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 [2021-12-19 17:46:41,450 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:41,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:41,451 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) [2021-12-19 17:46:41,452 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 [2021-12-19 17:46:41,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:41,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:41,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:41,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:41,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:41,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:41,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:41,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:41,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:41,487 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 [2021-12-19 17:46:41,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:41,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:41,489 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) [2021-12-19 17:46:41,490 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 [2021-12-19 17:46:41,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 [2021-12-19 17:46:41,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:41,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:41,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:41,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:41,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:41,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:41,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:41,539 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 [2021-12-19 17:46:41,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:41,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:41,548 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) [2021-12-19 17:46:41,550 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 [2021-12-19 17:46:41,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:41,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:41,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:41,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:41,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:41,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:41,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:41,582 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:46:41,620 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-12-19 17:46:41,620 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2021-12-19 17:46:41,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:41,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:41,636 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) [2021-12-19 17:46:41,675 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 [2021-12-19 17:46:41,675 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:46:41,693 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 17:46:41,694 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:46:41,694 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~n~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2021-12-19 17:46:41,711 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 [2021-12-19 17:46:41,714 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2021-12-19 17:46:41,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:41,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:46:41,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:41,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:46:41,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:46:41,784 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 [2021-12-19 17:46:41,785 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) [2021-12-19 17:46:41,821 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. [2021-12-19 17:46:41,822 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 [2021-12-19 17:46:41,825 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) [2021-12-19 17:46:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2021-12-19 17:46:41,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 2 letters. [2021-12-19 17:46:41,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:46:41,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 5 letters. Loop has 2 letters. [2021-12-19 17:46:41,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:46:41,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 4 letters. [2021-12-19 17:46:41,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:46:41,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 85 transitions. [2021-12-19 17:46:41,832 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-12-19 17:46:41,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 27 states and 38 transitions. [2021-12-19 17:46:41,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-19 17:46:41,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-19 17:46:41,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2021-12-19 17:46:41,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:46:41,837 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2021-12-19 17:46:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2021-12-19 17:46:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-19 17:46:41,861 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) [2021-12-19 17:46:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2021-12-19 17:46:41,862 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2021-12-19 17:46:41,862 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2021-12-19 17:46:41,862 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 17:46:41,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 38 transitions. [2021-12-19 17:46:41,862 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-12-19 17:46:41,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:46:41,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:46:41,863 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-19 17:46:41,863 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:46:41,863 INFO L791 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 150#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; 151#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; 153#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 142#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 146#merge_sortENTRY [2021-12-19 17:46:41,863 INFO L793 eck$LassoCheckResult]: Loop: 146#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 147#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); 140#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 146#merge_sortENTRY [2021-12-19 17:46:41,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:41,863 INFO L85 PathProgramCache]: Analyzing trace with hash 85954193, now seen corresponding path program 1 times [2021-12-19 17:46:41,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:41,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905207558] [2021-12-19 17:46:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:41,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:41,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:46:41,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:46:41,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905207558] [2021-12-19 17:46:41,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905207558] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:46:41,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:46:41,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:46:41,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370748828] [2021-12-19 17:46:41,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:46:41,907 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:46:41,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:41,908 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 1 times [2021-12-19 17:46:41,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:41,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488957233] [2021-12-19 17:46:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:41,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:41,922 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:41,928 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:42,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:46:42,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:46:42,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:46:42,073 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) [2021-12-19 17:46:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:46:42,083 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2021-12-19 17:46:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:46:42,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 36 transitions. [2021-12-19 17:46:42,084 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-12-19 17:46:42,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 36 transitions. [2021-12-19 17:46:42,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-12-19 17:46:42,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-19 17:46:42,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2021-12-19 17:46:42,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:46:42,086 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-12-19 17:46:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2021-12-19 17:46:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-19 17:46:42,087 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) [2021-12-19 17:46:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2021-12-19 17:46:42,087 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-12-19 17:46:42,087 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-12-19 17:46:42,088 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 17:46:42,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2021-12-19 17:46:42,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-12-19 17:46:42,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:46:42,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:46:42,088 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:46:42,088 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:46:42,088 INFO L791 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 211#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; 212#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; 214#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; 215#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 216#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 202#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 209#merge_sortENTRY [2021-12-19 17:46:42,089 INFO L793 eck$LassoCheckResult]: Loop: 209#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 210#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); 203#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 209#merge_sortENTRY [2021-12-19 17:46:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash 997650291, now seen corresponding path program 1 times [2021-12-19 17:46:42,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:42,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850160159] [2021-12-19 17:46:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:42,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:42,097 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:42,105 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:42,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:42,105 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 2 times [2021-12-19 17:46:42,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:42,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236299441] [2021-12-19 17:46:42,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:42,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:42,110 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:42,114 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:42,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:42,115 INFO L85 PathProgramCache]: Analyzing trace with hash -173868929, now seen corresponding path program 1 times [2021-12-19 17:46:42,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:42,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084678461] [2021-12-19 17:46:42,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:42,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:46:42,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:46:42,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084678461] [2021-12-19 17:46:42,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084678461] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:46:42,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840181639] [2021-12-19 17:46:42,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:42,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:46:42,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:42,168 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:46:42,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-19 17:46:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:42,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 17:46:42,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:46:42,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:46:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:46:42,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840181639] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:46:42,255 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:46:42,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2021-12-19 17:46:42,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106032322] [2021-12-19 17:46:42,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:46:42,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:46:42,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-19 17:46:42,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-19 17:46:42,383 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) [2021-12-19 17:46:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:46:42,436 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-12-19 17:46:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 17:46:42,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2021-12-19 17:46:42,440 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-12-19 17:46:42,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 32 states and 41 transitions. [2021-12-19 17:46:42,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-12-19 17:46:42,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-12-19 17:46:42,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2021-12-19 17:46:42,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:46:42,442 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2021-12-19 17:46:42,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2021-12-19 17:46:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2021-12-19 17:46:42,443 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) [2021-12-19 17:46:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-19 17:46:42,444 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-19 17:46:42,444 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-19 17:46:42,444 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 17:46:42,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2021-12-19 17:46:42,457 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-12-19 17:46:42,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:46:42,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:46:42,458 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2021-12-19 17:46:42,458 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:46:42,459 INFO L791 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 346#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; 347#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; 349#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; 350#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 351#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; 352#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 363#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 337#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 344#merge_sortENTRY [2021-12-19 17:46:42,459 INFO L793 eck$LassoCheckResult]: Loop: 344#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 345#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); 336#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 344#merge_sortENTRY [2021-12-19 17:46:42,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:42,459 INFO L85 PathProgramCache]: Analyzing trace with hash 964272085, now seen corresponding path program 2 times [2021-12-19 17:46:42,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:42,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221540399] [2021-12-19 17:46:42,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:42,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:42,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:42,490 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:42,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:42,491 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 3 times [2021-12-19 17:46:42,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:42,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131056068] [2021-12-19 17:46:42,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:42,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:42,495 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:42,508 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:42,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1888408797, now seen corresponding path program 2 times [2021-12-19 17:46:42,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:42,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579438735] [2021-12-19 17:46:42,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:42,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:42,535 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:42,553 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:42,982 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:46:42,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:46:42,983 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:46:42,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:46:42,983 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:46:42,983 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:42,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:46:42,983 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:46:42,983 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2021-12-19 17:46:42,983 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:46:42,983 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:46:42,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:42,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:42,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:42,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:42,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:42,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:42,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:43,387 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:46:43,387 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:46:43,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:43,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:43,388 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:43,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-19 17:46:43,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:43,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:43,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:43,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:43,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:43,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:43,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:43,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:43,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:43,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:43,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:43,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:43,427 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:43,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-19 17:46:43,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:43,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:43,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:43,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:43,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:43,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:43,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:43,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:43,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:43,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:43,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:43,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:43,460 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:43,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-19 17:46:43,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:43,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:43,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:43,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:43,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:43,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:43,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:43,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:43,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:43,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:43,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:43,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:43,528 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:43,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-19 17:46:43,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:43,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:43,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:43,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:43,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:43,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:43,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:43,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:43,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:43,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:43,599 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:43,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:43,600 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:43,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-19 17:46:43,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:43,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:43,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:43,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:43,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:43,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:43,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:43,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:43,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:43,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-12-19 17:46:43,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:43,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:43,631 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:43,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-19 17:46:43,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:43,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:43,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:43,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:43,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:43,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:43,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:43,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:43,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:43,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:43,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:43,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:43,663 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:43,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-19 17:46:43,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:43,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:43,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:43,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:43,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:43,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:43,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:43,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:43,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:43,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:43,728 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:43,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:43,743 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:43,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:43,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:43,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:43,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:43,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:43,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:43,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:43,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:43,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-19 17:46:43,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:43,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:43,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:43,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:43,824 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:43,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-19 17:46:43,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:43,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:43,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:43,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:43,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:43,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:43,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:43,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:43,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:43,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-12-19 17:46:43,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:43,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:43,851 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:43,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-19 17:46:43,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:43,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:43,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:43,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:43,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:43,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:43,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:43,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:43,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:43,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:43,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:43,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:43,892 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:43,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-19 17:46:43,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:43,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:43,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:43,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:43,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:43,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:43,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:43,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:43,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:43,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:43,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:43,935 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:43,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-19 17:46:43,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:43,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:43,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:43,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:43,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:43,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:43,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:43,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:43,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:43,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:43,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:43,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:43,983 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:43,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-19 17:46:43,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:43,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:43,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:43,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:43,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:43,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:43,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:43,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:43,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:44,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,011 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-19 17:46:44,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:44,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,096 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-19 17:46:44,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:44,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,131 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-19 17:46:44,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:44,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,174 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-19 17:46:44,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:44,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,216 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-19 17:46:44,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,247 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 [2021-12-19 17:46:44,248 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,249 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-19 17:46:44,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,258 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,277 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 [2021-12-19 17:46:44,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,279 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-19 17:46:44,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-19 17:46:44,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,321 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-19 17:46:44,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-19 17:46:44,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,357 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-19 17:46:44,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-19 17:46:44,389 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,390 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-19 17:46:44,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-19 17:46:44,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,423 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-19 17:46:44,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-12-19 17:46:44,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,454 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-19 17:46:44,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:44,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,487 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-19 17:46:44,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:44,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:44,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-12-19 17:46:44,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,520 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-19 17:46:44,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,561 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 [2021-12-19 17:46:44,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,562 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-19 17:46:44,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-19 17:46:44,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,601 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-19 17:46:44,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,630 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 [2021-12-19 17:46:44,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,632 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-19 17:46:44,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,678 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 [2021-12-19 17:46:44,678 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,679 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-19 17:46:44,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 [2021-12-19 17:46:44,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-12-19 17:46:44,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,719 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-19 17:46:44,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:44,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,748 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-19 17:46:44,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-19 17:46:44,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,794 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-19 17:46:44,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-19 17:46:44,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,861 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-19 17:46:44,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,870 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,884 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 [2021-12-19 17:46:44,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,885 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-19 17:46:44,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-19 17:46:44,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,932 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-19 17:46:44,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:44,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:44,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:44,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:44,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-12-19 17:46:44,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:44,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:44,957 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:44,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-19 17:46:44,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:44,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:44,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:44,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:44,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:44,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:44,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:44,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:45,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:45,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:45,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:45,024 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:45,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-19 17:46:45,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 [2021-12-19 17:46:45,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:45,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:45,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:45,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:45,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:45,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:45,051 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:46:45,075 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-12-19 17:46:45,075 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-19 17:46:45,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:45,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:45,107 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:45,109 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:46:45,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-19 17:46:45,126 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 17:46:45,126 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:46:45,126 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n#1) = 1*merge_sort_#in~n#1 Supporting invariants [] [2021-12-19 17:46:45,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:45,144 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2021-12-19 17:46:45,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:45,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:46:45,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:45,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 17:46:45,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:46:45,229 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 [2021-12-19 17:46:45,229 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) [2021-12-19 17:46:45,259 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. [2021-12-19 17:46:45,259 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 [2021-12-19 17:46:45,260 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) [2021-12-19 17:46:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-12-19 17:46:45,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2021-12-19 17:46:45,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:46:45,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2021-12-19 17:46:45,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:46:45,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2021-12-19 17:46:45,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:46:45,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2021-12-19 17:46:45,262 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-12-19 17:46:45,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 38 states and 50 transitions. [2021-12-19 17:46:45,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-12-19 17:46:45,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-12-19 17:46:45,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. [2021-12-19 17:46:45,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:46:45,263 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2021-12-19 17:46:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. [2021-12-19 17:46:45,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2021-12-19 17:46:45,265 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) [2021-12-19 17:46:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2021-12-19 17:46:45,266 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2021-12-19 17:46:45,266 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2021-12-19 17:46:45,266 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 17:46:45,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2021-12-19 17:46:45,267 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-12-19 17:46:45,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:46:45,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:46:45,267 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:46:45,267 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2021-12-19 17:46:45,268 INFO L791 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 501#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; 502#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; 504#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; 505#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 506#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; 507#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 522#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 490#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 495#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 496#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); 489#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 497#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 498#L24 assume ~n#1 < 2; 513#merge_sortFINAL assume true; 512#merge_sortEXIT >#87#return; 488#L27-1 [2021-12-19 17:46:45,268 INFO L793 eck$LassoCheckResult]: Loop: 488#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 514#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 521#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); 491#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 514#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 521#L24 assume ~n#1 < 2; 503#merge_sortFINAL assume true; 520#merge_sortEXIT >#87#return; 488#L27-1 [2021-12-19 17:46:45,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash 825176348, now seen corresponding path program 1 times [2021-12-19 17:46:45,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:45,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116581332] [2021-12-19 17:46:45,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:45,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:45,283 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:45,304 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:45,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1429943866, now seen corresponding path program 1 times [2021-12-19 17:46:45,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:45,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697715635] [2021-12-19 17:46:45,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:45,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:45,310 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:45,315 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:45,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:45,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1545528235, now seen corresponding path program 1 times [2021-12-19 17:46:45,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:45,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130452156] [2021-12-19 17:46:45,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:45,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:45,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-19 17:46:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:45,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-19 17:46:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-19 17:46:45,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:46:45,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130452156] [2021-12-19 17:46:45,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130452156] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:46:45,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975670454] [2021-12-19 17:46:45,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:45,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:46:45,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:45,486 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:46:45,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2021-12-19 17:46:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:45,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 17:46:45,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:46:45,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:46:45,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-19 17:46:45,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975670454] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:46:45,741 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:46:45,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2021-12-19 17:46:45,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223837898] [2021-12-19 17:46:45,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:46:46,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:46:46,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-19 17:46:46,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-12-19 17:46:46,001 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) [2021-12-19 17:46:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:46:46,215 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2021-12-19 17:46:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-19 17:46:46,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 91 transitions. [2021-12-19 17:46:46,218 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2021-12-19 17:46:46,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 86 transitions. [2021-12-19 17:46:46,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2021-12-19 17:46:46,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2021-12-19 17:46:46,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 86 transitions. [2021-12-19 17:46:46,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:46:46,220 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 86 transitions. [2021-12-19 17:46:46,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 86 transitions. [2021-12-19 17:46:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2021-12-19 17:46:46,223 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) [2021-12-19 17:46:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2021-12-19 17:46:46,223 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2021-12-19 17:46:46,223 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2021-12-19 17:46:46,223 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 17:46:46,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 81 transitions. [2021-12-19 17:46:46,224 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2021-12-19 17:46:46,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:46:46,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:46:46,224 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:46:46,224 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2021-12-19 17:46:46,224 INFO L791 eck$LassoCheckResult]: Stem: 811#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 796#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; 797#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; 799#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; 800#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 801#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; 802#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 832#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; 831#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 830#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 786#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 827#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 792#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); 784#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 791#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 793#L24 assume ~n#1 < 2; 815#merge_sortFINAL assume true; 807#merge_sortEXIT >#87#return; 785#L27-1 [2021-12-19 17:46:46,225 INFO L793 eck$LassoCheckResult]: Loop: 785#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 810#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 839#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); 787#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 810#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 839#L24 assume ~n#1 < 2; 808#merge_sortFINAL assume true; 809#merge_sortEXIT >#87#return; 785#L27-1 [2021-12-19 17:46:46,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:46,225 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 2 times [2021-12-19 17:46:46,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:46,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20736663] [2021-12-19 17:46:46,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:46,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:46,234 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:46,248 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:46,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:46,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1429943866, now seen corresponding path program 2 times [2021-12-19 17:46:46,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:46,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548628053] [2021-12-19 17:46:46,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:46,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:46,252 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:46,256 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:46,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1251148749, now seen corresponding path program 2 times [2021-12-19 17:46:46,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:46,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432441875] [2021-12-19 17:46:46,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:46,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:46,270 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:46,291 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:47,178 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:46:47,179 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:46:47,179 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:46:47,179 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:46:47,179 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:46:47,179 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,179 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:46:47,179 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:46:47,179 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration6_Lasso [2021-12-19 17:46:47,179 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:46:47,179 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:46:47,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:47,630 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:46:47,630 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:46:47,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,631 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:47,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-19 17:46:47,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:47,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:47,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:47,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:47,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:47,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:47,654 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 [2021-12-19 17:46:47,655 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,656 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:47,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-19 17:46:47,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:47,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:47,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:47,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:47,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:47,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:47,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-12-19 17:46:47,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,684 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) [2021-12-19 17:46:47,685 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 [2021-12-19 17:46:47,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:47,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:47,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:47,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:47,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:47,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-12-19 17:46:47,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,711 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:47,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-19 17:46:47,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:47,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:47,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:47,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:47,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:47,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:47,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-12-19 17:46:47,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,739 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:47,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-19 17:46:47,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:47,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:47,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:47,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:47,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:47,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:47,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-12-19 17:46:47,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,778 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:47,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-19 17:46:47,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:47,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:47,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:47,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:47,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:47,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:47,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:47,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,803 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:47,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-19 17:46:47,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:47,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:47,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:47,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:47,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:47,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:47,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-12-19 17:46:47,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,827 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:47,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-19 17:46:47,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:47,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:47,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:47,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:47,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:47,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:47,850 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 [2021-12-19 17:46:47,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,851 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:47,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-19 17:46:47,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:47,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:47,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:47,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:47,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:47,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:47,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-12-19 17:46:47,874 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,875 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:47,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-19 17:46:47,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:47,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:47,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:47,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:47,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:47,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:47,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-12-19 17:46:47,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,902 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:47,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-19 17:46:47,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:47,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:47,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:47,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:47,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:47,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:47,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:47,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,927 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:47,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-19 17:46:47,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 [2021-12-19 17:46:47,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:47,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:47,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:47,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:47,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:47,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-12-19 17:46:47,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,952 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:47,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-12-19 17:46:47,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:47,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:47,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:47,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:47,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:47,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:47,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2021-12-19 17:46:47,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:47,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:47,976 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:47,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-12-19 17:46:47,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:47,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:47,984 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-19 17:46:47,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:47,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:47,986 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-19 17:46:47,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:47,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:48,012 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 [2021-12-19 17:46:48,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:48,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:48,013 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:48,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-12-19 17:46:48,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:48,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:48,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:48,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:48,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:48,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:48,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:48,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:48,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2021-12-19 17:46:48,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:48,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:48,052 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:48,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-12-19 17:46:48,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:48,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:48,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:48,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:48,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:48,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:48,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:48,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:48,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:48,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:48,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:48,082 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:48,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-19 17:46:48,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:48,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:48,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:48,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:48,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:48,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:48,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:48,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:48,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:48,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:48,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:48,109 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:48,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-12-19 17:46:48,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 [2021-12-19 17:46:48,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:48,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:48,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:48,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:48,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:48,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:48,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:48,137 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 [2021-12-19 17:46:48,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:48,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:48,138 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:48,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-12-19 17:46:48,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:48,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:48,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:48,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:48,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:48,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:48,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:48,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:48,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:48,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:48,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:48,166 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:48,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-12-19 17:46:48,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 [2021-12-19 17:46:48,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:48,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:48,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:48,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:48,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:48,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:48,197 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:46:48,206 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-19 17:46:48,207 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-19 17:46:48,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:48,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:48,208 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:48,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-12-19 17:46:48,210 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:46:48,231 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 17:46:48,231 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:46:48,231 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_~m~0#1, merge_sort_~n#1) = -1*merge_sort_~m~0#1 + 1*merge_sort_~n#1 Supporting invariants [] [2021-12-19 17:46:48,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:48,255 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-12-19 17:46:48,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:48,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 17:46:48,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:48,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 17:46:48,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:46:48,403 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2021-12-19 17:46:48,403 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 23 Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 17:46:48,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:48,547 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 23. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 323 states and 438 transitions. Complement of second has 28 states. [2021-12-19 17:46:48,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-19 17:46:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 17:46:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2021-12-19 17:46:48,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 70 transitions. Stem has 18 letters. Loop has 8 letters. [2021-12-19 17:46:48,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:46:48,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 70 transitions. Stem has 26 letters. Loop has 8 letters. [2021-12-19 17:46:48,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:46:48,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 70 transitions. Stem has 18 letters. Loop has 16 letters. [2021-12-19 17:46:48,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:46:48,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 323 states and 438 transitions. [2021-12-19 17:46:48,554 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2021-12-19 17:46:48,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 323 states to 235 states and 325 transitions. [2021-12-19 17:46:48,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2021-12-19 17:46:48,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172 [2021-12-19 17:46:48,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 325 transitions. [2021-12-19 17:46:48,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:46:48,558 INFO L681 BuchiCegarLoop]: Abstraction has 235 states and 325 transitions. [2021-12-19 17:46:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 325 transitions. [2021-12-19 17:46:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 214. [2021-12-19 17:46:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 177 states have (on average 1.2937853107344632) internal successors, (229), 179 states have internal predecessors, (229), 23 states have call successors, (27), 14 states have call predecessors, (27), 14 states have return successors, (34), 20 states have call predecessors, (34), 21 states have call successors, (34) [2021-12-19 17:46:48,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 290 transitions. [2021-12-19 17:46:48,570 INFO L704 BuchiCegarLoop]: Abstraction has 214 states and 290 transitions. [2021-12-19 17:46:48,570 INFO L587 BuchiCegarLoop]: Abstraction has 214 states and 290 transitions. [2021-12-19 17:46:48,570 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 17:46:48,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 290 transitions. [2021-12-19 17:46:48,572 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 78 [2021-12-19 17:46:48,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:46:48,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:46:48,573 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:46:48,573 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 17:46:48,573 INFO L791 eck$LassoCheckResult]: Stem: 1365#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1339#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; 1340#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; 1344#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; 1345#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1346#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; 1347#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1390#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1316#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1387#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1419#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); 1330#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1329#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1331#L24 assume ~n#1 < 2; 1501#merge_sortFINAL assume true; 1498#merge_sortEXIT >#87#return; 1357#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1374#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1380#L24 assume ~n#1 < 2; 1381#merge_sortFINAL assume true; 1356#merge_sortEXIT >#89#return; 1352#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; 1353#L11-3 [2021-12-19 17:46:48,573 INFO L793 eck$LassoCheckResult]: Loop: 1353#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1348#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; 1349#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; 1385#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 1353#L11-3 [2021-12-19 17:46:48,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:48,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1029593046, now seen corresponding path program 1 times [2021-12-19 17:46:48,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:48,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460491014] [2021-12-19 17:46:48,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:48,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:48,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:48,593 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:48,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:48,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1388838, now seen corresponding path program 1 times [2021-12-19 17:46:48,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:48,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757562199] [2021-12-19 17:46:48,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:48,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:48,597 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:48,600 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:48,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash -874210097, now seen corresponding path program 1 times [2021-12-19 17:46:48,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:48,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958286225] [2021-12-19 17:46:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:48,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:48,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-19 17:46:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:48,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-19 17:46:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-19 17:46:48,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:46:48,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958286225] [2021-12-19 17:46:48,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958286225] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:46:48,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:46:48,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 17:46:48,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187171849] [2021-12-19 17:46:48,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:46:48,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:46:48,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 17:46:48,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 17:46:48,740 INFO L87 Difference]: Start difference. First operand 214 states and 290 transitions. cyclomatic complexity: 100 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:46:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:46:48,810 INFO L93 Difference]: Finished difference Result 350 states and 488 transitions. [2021-12-19 17:46:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 17:46:48,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 488 transitions. [2021-12-19 17:46:48,819 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 136 [2021-12-19 17:46:48,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 350 states and 488 transitions. [2021-12-19 17:46:48,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 257 [2021-12-19 17:46:48,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 257 [2021-12-19 17:46:48,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 350 states and 488 transitions. [2021-12-19 17:46:48,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:46:48,831 INFO L681 BuchiCegarLoop]: Abstraction has 350 states and 488 transitions. [2021-12-19 17:46:48,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 488 transitions. [2021-12-19 17:46:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 268. [2021-12-19 17:46:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 231 states have (on average 1.2640692640692641) internal successors, (292), 233 states have internal predecessors, (292), 23 states have call successors, (27), 14 states have call predecessors, (27), 14 states have return successors, (34), 20 states have call predecessors, (34), 21 states have call successors, (34) [2021-12-19 17:46:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 353 transitions. [2021-12-19 17:46:48,858 INFO L704 BuchiCegarLoop]: Abstraction has 268 states and 353 transitions. [2021-12-19 17:46:48,858 INFO L587 BuchiCegarLoop]: Abstraction has 268 states and 353 transitions. [2021-12-19 17:46:48,858 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-19 17:46:48,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 268 states and 353 transitions. [2021-12-19 17:46:48,861 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2021-12-19 17:46:48,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:46:48,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:46:48,862 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:46:48,862 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:46:48,862 INFO L791 eck$LassoCheckResult]: Stem: 1958#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1928#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; 1929#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; 1932#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; 1933#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1934#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; 1935#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1936#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1938#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1981#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2023#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); 1953#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1954#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2027#L24 assume ~n#1 < 2; 2026#merge_sortFINAL assume true; 2025#merge_sortEXIT >#87#return; 1948#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1967#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2022#L24 assume ~n#1 < 2; 1951#merge_sortFINAL assume true; 1947#merge_sortEXIT >#89#return; 1943#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; 1944#L11-3 [2021-12-19 17:46:48,862 INFO L793 eck$LassoCheckResult]: Loop: 1944#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1937#L12 assume !(merge_~j~0#1 == merge_~n#1); 1940#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); 2163#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 2161#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 2160#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 1985#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; 1979#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 1944#L11-3 [2021-12-19 17:46:48,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:48,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1029593046, now seen corresponding path program 2 times [2021-12-19 17:46:48,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:48,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003880108] [2021-12-19 17:46:48,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:48,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:48,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:48,896 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:48,898 INFO L85 PathProgramCache]: Analyzing trace with hash -120477233, now seen corresponding path program 1 times [2021-12-19 17:46:48,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:48,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116652921] [2021-12-19 17:46:48,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:48,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:48,904 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:48,912 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:48,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:48,914 INFO L85 PathProgramCache]: Analyzing trace with hash 843127032, now seen corresponding path program 1 times [2021-12-19 17:46:48,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:48,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513309119] [2021-12-19 17:46:48,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:48,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:48,941 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:48,966 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:50,329 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:46:50,329 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:46:50,329 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:46:50,329 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:46:50,329 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:46:50,329 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:50,329 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:46:50,329 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:46:50,329 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration8_Lasso [2021-12-19 17:46:50,329 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:46:50,329 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:46:50,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:50,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:46:51,468 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:46:51,469 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:46:51,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,470 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-12-19 17:46:51,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 [2021-12-19 17:46:51,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:51,499 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,500 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-12-19 17:46:51,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-12-19 17:46:51,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,523 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-12-19 17:46:51,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2021-12-19 17:46:51,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,545 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-12-19 17:46:51,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-12-19 17:46:51,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,568 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-12-19 17:46:51,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-12-19 17:46:51,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,592 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-12-19 17:46:51,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2021-12-19 17:46:51,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,614 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-12-19 17:46:51,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2021-12-19 17:46:51,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,638 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-12-19 17:46:51,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2021-12-19 17:46:51,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,663 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-12-19 17:46:51,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,686 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2021-12-19 17:46:51,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,701 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-12-19 17:46:51,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:51,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,740 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-12-19 17:46:51,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2021-12-19 17:46:51,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,766 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-12-19 17:46:51,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2021-12-19 17:46:51,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,799 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-12-19 17:46:51,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2021-12-19 17:46:51,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,829 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-12-19 17:46:51,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:51,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:51,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2021-12-19 17:46:51,868 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,869 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-12-19 17:46:51,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:46:51,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:46:51,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:46:51,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2021-12-19 17:46:51,907 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,907 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-12-19 17:46:51,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,916 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2021-12-19 17:46:51,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,921 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2021-12-19 17:46:51,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:51,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2021-12-19 17:46:51,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,952 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-12-19 17:46:51,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:51,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:51,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:51,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:51,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:51,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:51,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:51,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:51,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:51,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:51,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:51,995 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:51,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-12-19 17:46:51,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:52,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:52,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:52,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:52,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:52,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:52,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:52,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:52,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2021-12-19 17:46:52,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:52,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:52,033 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:52,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-12-19 17:46:52,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:52,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:52,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:52,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:52,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:52,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:52,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:52,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:52,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2021-12-19 17:46:52,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:52,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:52,061 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:52,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2021-12-19 17:46:52,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:52,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:52,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:52,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:52,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:52,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:52,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:52,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:52,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:52,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:52,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:52,087 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:52,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2021-12-19 17:46:52,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:52,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:52,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:52,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:46:52,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:52,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:46:52,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:46:52,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:46:52,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2021-12-19 17:46:52,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:52,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:52,117 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:52,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2021-12-19 17:46:52,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:46:52,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:46:52,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:46:52,126 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2021-12-19 17:46:52,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:46:52,203 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2021-12-19 17:46:52,203 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2021-12-19 17:46:52,650 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:46:55,584 INFO L443 ModelExtractionUtils]: Simplification made 86 calls to the SMT solver. [2021-12-19 17:46:55,584 INFO L444 ModelExtractionUtils]: 78 out of 190 variables were initially zero. Simplification set additionally 101 variables to zero. [2021-12-19 17:46:55,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:46:55,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:55,585 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:46:55,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2021-12-19 17:46:55,587 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:46:55,596 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 8. [2021-12-19 17:46:55,597 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:46:55,597 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length merge_sort_merge_~x~0#1.base)_1, merge_sort_merge_~i~0#1, v_rep(select #length merge_sort_merge_~a#1.base)_1) = 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_1 - 4*merge_sort_merge_~i~0#1 + 1*v_rep(select #length merge_sort_merge_~a#1.base)_1 Supporting invariants [-4*merge_sort_merge_~j~0#1 + 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_1 >= 0, 1*merge_sort_merge_~a#1.offset >= 0, -4*merge_sort_merge_~m#1 + 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_1 >= 0, -4*merge_sort_merge_~j~0#1 + 1*v_rep(select #length merge_sort_merge_~a#1.base)_1 >= 0] [2021-12-19 17:46:55,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:55,650 INFO L297 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2021-12-19 17:46:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:55,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-19 17:46:55,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:55,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:46:55,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:46:55,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2021-12-19 17:46:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:56,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-19 17:46:56,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:46:56,277 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 4 loop predicates [2021-12-19 17:46:56,277 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 268 states and 353 transitions. cyclomatic complexity: 109 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:46:56,675 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 268 states and 353 transitions. cyclomatic complexity: 109. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 357 states and 484 transitions. Complement of second has 30 states. [2021-12-19 17:46:56,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 8 stem states 3 non-accepting loop states 2 accepting loop states [2021-12-19 17:46:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:46:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 36 transitions. [2021-12-19 17:46:56,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 36 transitions. Stem has 22 letters. Loop has 8 letters. [2021-12-19 17:46:56,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:46:56,687 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:46:56,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:56,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-19 17:46:56,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:56,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:46:56,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:46:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:57,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-19 17:46:57,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:46:57,250 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 4 loop predicates [2021-12-19 17:46:57,251 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 268 states and 353 transitions. cyclomatic complexity: 109 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:46:57,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 268 states and 353 transitions. cyclomatic complexity: 109. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 359 states and 490 transitions. Complement of second has 33 states. [2021-12-19 17:46:57,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 8 stem states 4 non-accepting loop states 2 accepting loop states [2021-12-19 17:46:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:46:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 37 transitions. [2021-12-19 17:46:57,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 37 transitions. Stem has 22 letters. Loop has 8 letters. [2021-12-19 17:46:57,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:46:57,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 37 transitions. Stem has 30 letters. Loop has 8 letters. [2021-12-19 17:46:57,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:46:57,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 37 transitions. Stem has 22 letters. Loop has 16 letters. [2021-12-19 17:46:57,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:46:57,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 359 states and 490 transitions. [2021-12-19 17:46:57,634 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 124 [2021-12-19 17:46:57,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 359 states to 349 states and 478 transitions. [2021-12-19 17:46:57,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2021-12-19 17:46:57,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2021-12-19 17:46:57,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 349 states and 478 transitions. [2021-12-19 17:46:57,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:46:57,637 INFO L681 BuchiCegarLoop]: Abstraction has 349 states and 478 transitions. [2021-12-19 17:46:57,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states and 478 transitions. [2021-12-19 17:46:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 292. [2021-12-19 17:46:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 255 states have (on average 1.2784313725490195) internal successors, (326), 257 states have internal predecessors, (326), 23 states have call successors, (27), 14 states have call predecessors, (27), 14 states have return successors, (34), 20 states have call predecessors, (34), 21 states have call successors, (34) [2021-12-19 17:46:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 387 transitions. [2021-12-19 17:46:57,647 INFO L704 BuchiCegarLoop]: Abstraction has 292 states and 387 transitions. [2021-12-19 17:46:57,647 INFO L587 BuchiCegarLoop]: Abstraction has 292 states and 387 transitions. [2021-12-19 17:46:57,647 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-19 17:46:57,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 292 states and 387 transitions. [2021-12-19 17:46:57,649 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2021-12-19 17:46:57,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:46:57,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:46:57,650 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:46:57,650 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:46:57,650 INFO L791 eck$LassoCheckResult]: Stem: 3326#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3295#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; 3296#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; 3303#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; 3304#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 3305#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; 3306#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 3385#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 3277#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 3350#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3411#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); 3406#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3407#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3412#L24 assume ~n#1 < 2; 3410#merge_sortFINAL assume true; 3405#merge_sortEXIT >#87#return; 3399#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 3402#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3408#L24 assume ~n#1 < 2; 3403#merge_sortFINAL assume true; 3398#merge_sortEXIT >#89#return; 3396#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; 3397#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 3432#L11-4 merge_~i~0#1 := 0; 3338#L17-3 [2021-12-19 17:46:57,650 INFO L793 eck$LassoCheckResult]: Loop: 3338#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; 3339#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 3338#L17-3 [2021-12-19 17:46:57,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1596438681, now seen corresponding path program 1 times [2021-12-19 17:46:57,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:57,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56620721] [2021-12-19 17:46:57,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:57,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:57,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-19 17:46:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:57,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-19 17:46:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-19 17:46:57,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:46:57,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56620721] [2021-12-19 17:46:57,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56620721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:46:57,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:46:57,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 17:46:57,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981410121] [2021-12-19 17:46:57,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:46:57,701 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:46:57,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:57,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2021-12-19 17:46:57,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:57,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811999204] [2021-12-19 17:46:57,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:57,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:57,703 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:57,705 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:57,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:46:57,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 17:46:57,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 17:46:57,743 INFO L87 Difference]: Start difference. First operand 292 states and 387 transitions. cyclomatic complexity: 121 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:46:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:46:57,807 INFO L93 Difference]: Finished difference Result 427 states and 558 transitions. [2021-12-19 17:46:57,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 17:46:57,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 427 states and 558 transitions. [2021-12-19 17:46:57,811 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 122 [2021-12-19 17:46:57,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 427 states to 427 states and 558 transitions. [2021-12-19 17:46:57,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2021-12-19 17:46:57,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2021-12-19 17:46:57,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 427 states and 558 transitions. [2021-12-19 17:46:57,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:46:57,815 INFO L681 BuchiCegarLoop]: Abstraction has 427 states and 558 transitions. [2021-12-19 17:46:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states and 558 transitions. [2021-12-19 17:46:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 299. [2021-12-19 17:46:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 262 states have (on average 1.2633587786259541) internal successors, (331), 264 states have internal predecessors, (331), 23 states have call successors, (27), 14 states have call predecessors, (27), 14 states have return successors, (34), 20 states have call predecessors, (34), 21 states have call successors, (34) [2021-12-19 17:46:57,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 392 transitions. [2021-12-19 17:46:57,824 INFO L704 BuchiCegarLoop]: Abstraction has 299 states and 392 transitions. [2021-12-19 17:46:57,824 INFO L587 BuchiCegarLoop]: Abstraction has 299 states and 392 transitions. [2021-12-19 17:46:57,824 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-19 17:46:57,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 299 states and 392 transitions. [2021-12-19 17:46:57,825 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2021-12-19 17:46:57,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:46:57,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:46:57,826 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:46:57,826 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:46:57,826 INFO L791 eck$LassoCheckResult]: Stem: 4064#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4025#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; 4026#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; 4035#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; 4036#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4037#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; 4038#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4039#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 4043#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 4090#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4184#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); 4015#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4014#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4016#L24 assume ~n#1 < 2; 4183#merge_sortFINAL assume true; 4181#merge_sortEXIT >#87#return; 4178#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 4179#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4182#L24 assume ~n#1 < 2; 4180#merge_sortFINAL assume true; 4177#merge_sortEXIT >#89#return; 4162#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; 4176#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 4153#L12 assume !(merge_~j~0#1 == merge_~n#1); 4174#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; 4167#L13-2 [2021-12-19 17:46:57,826 INFO L793 eck$LassoCheckResult]: Loop: 4167#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 4158#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; 4154#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 4155#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 4165#L12 assume !(merge_~j~0#1 == merge_~n#1); 4166#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; 4167#L13-2 [2021-12-19 17:46:57,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:57,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2050009704, now seen corresponding path program 1 times [2021-12-19 17:46:57,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:57,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528946983] [2021-12-19 17:46:57,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:57,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:57,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-19 17:46:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-19 17:46:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-19 17:46:57,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:46:57,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528946983] [2021-12-19 17:46:57,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528946983] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:46:57,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:46:57,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 17:46:57,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780162692] [2021-12-19 17:46:57,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:46:57,873 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:46:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1895288687, now seen corresponding path program 1 times [2021-12-19 17:46:57,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:57,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581443357] [2021-12-19 17:46:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:57,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:57,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:57,881 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:57,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:46:57,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 17:46:57,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 17:46:57,962 INFO L87 Difference]: Start difference. First operand 299 states and 392 transitions. cyclomatic complexity: 119 Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:46:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:46:58,005 INFO L93 Difference]: Finished difference Result 400 states and 533 transitions. [2021-12-19 17:46:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 17:46:58,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 400 states and 533 transitions. [2021-12-19 17:46:58,009 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 164 [2021-12-19 17:46:58,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 400 states to 400 states and 533 transitions. [2021-12-19 17:46:58,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2021-12-19 17:46:58,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2021-12-19 17:46:58,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 400 states and 533 transitions. [2021-12-19 17:46:58,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:46:58,012 INFO L681 BuchiCegarLoop]: Abstraction has 400 states and 533 transitions. [2021-12-19 17:46:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states and 533 transitions. [2021-12-19 17:46:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 364. [2021-12-19 17:46:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 327 states have (on average 1.2660550458715596) internal successors, (414), 329 states have internal predecessors, (414), 23 states have call successors, (27), 14 states have call predecessors, (27), 14 states have return successors, (34), 20 states have call predecessors, (34), 21 states have call successors, (34) [2021-12-19 17:46:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 475 transitions. [2021-12-19 17:46:58,026 INFO L704 BuchiCegarLoop]: Abstraction has 364 states and 475 transitions. [2021-12-19 17:46:58,026 INFO L587 BuchiCegarLoop]: Abstraction has 364 states and 475 transitions. [2021-12-19 17:46:58,026 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-19 17:46:58,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 364 states and 475 transitions. [2021-12-19 17:46:58,028 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 162 [2021-12-19 17:46:58,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:46:58,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:46:58,028 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:46:58,028 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:46:58,029 INFO L791 eck$LassoCheckResult]: Stem: 4780#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4747#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; 4748#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; 4757#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; 4758#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4759#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; 4760#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4761#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; 4811#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4810#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 4725#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 4831#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4797#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); 4737#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4736#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4739#L24 assume ~n#1 < 2; 4830#merge_sortFINAL assume true; 4829#merge_sortEXIT >#87#return; 4742#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 4825#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4823#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); 4730#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4818#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4897#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); 4877#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4928#merge_sortENTRY [2021-12-19 17:46:58,029 INFO L793 eck$LassoCheckResult]: Loop: 4928#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4873#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); 4875#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4928#merge_sortENTRY [2021-12-19 17:46:58,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash -178906914, now seen corresponding path program 3 times [2021-12-19 17:46:58,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:58,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967417261] [2021-12-19 17:46:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:58,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:58,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-19 17:46:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:46:58,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:46:58,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967417261] [2021-12-19 17:46:58,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967417261] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:46:58,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293441543] [2021-12-19 17:46:58,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 17:46:58,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:46:58,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:58,177 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:46:58,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2021-12-19 17:46:58,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-19 17:46:58,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:46:58,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 17:46:58,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:46:58,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:46:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:46:58,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293441543] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:46:58,473 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:46:58,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 25 [2021-12-19 17:46:58,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877115300] [2021-12-19 17:46:58,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:46:58,474 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:46:58,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 4 times [2021-12-19 17:46:58,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:58,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564984692] [2021-12-19 17:46:58,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:58,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:58,477 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:58,479 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:58,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:46:58,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-19 17:46:58,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2021-12-19 17:46:58,597 INFO L87 Difference]: Start difference. First operand 364 states and 475 transitions. cyclomatic complexity: 137 Second operand has 25 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 20 states have internal predecessors, (35), 7 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 17:46:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:46:59,153 INFO L93 Difference]: Finished difference Result 727 states and 950 transitions. [2021-12-19 17:46:59,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-19 17:46:59,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 727 states and 950 transitions. [2021-12-19 17:46:59,161 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 340 [2021-12-19 17:46:59,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 727 states to 719 states and 939 transitions. [2021-12-19 17:46:59,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 564 [2021-12-19 17:46:59,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 581 [2021-12-19 17:46:59,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 719 states and 939 transitions. [2021-12-19 17:46:59,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:46:59,168 INFO L681 BuchiCegarLoop]: Abstraction has 719 states and 939 transitions. [2021-12-19 17:46:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states and 939 transitions. [2021-12-19 17:46:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 591. [2021-12-19 17:46:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 522 states have (on average 1.2547892720306513) internal successors, (655), 526 states have internal predecessors, (655), 41 states have call successors, (48), 29 states have call predecessors, (48), 28 states have return successors, (57), 35 states have call predecessors, (57), 37 states have call successors, (57) [2021-12-19 17:46:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 760 transitions. [2021-12-19 17:46:59,180 INFO L704 BuchiCegarLoop]: Abstraction has 591 states and 760 transitions. [2021-12-19 17:46:59,180 INFO L587 BuchiCegarLoop]: Abstraction has 591 states and 760 transitions. [2021-12-19 17:46:59,181 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-19 17:46:59,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 591 states and 760 transitions. [2021-12-19 17:46:59,183 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 272 [2021-12-19 17:46:59,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:46:59,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:46:59,184 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:46:59,184 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:46:59,184 INFO L791 eck$LassoCheckResult]: Stem: 6094#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6065#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; 6066#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; 6074#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; 6075#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 6076#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; 6077#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 6162#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 6040#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 6124#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6216#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); 6214#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6220#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6217#L24 assume ~n#1 < 2; 6213#merge_sortFINAL assume true; 6215#merge_sortEXIT >#87#return; 6204#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 6205#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6253#L24 assume ~n#1 < 2; 6252#merge_sortFINAL assume true; 6251#merge_sortEXIT >#89#return; 6200#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; 6198#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6199#L12 assume !(merge_~j~0#1 == merge_~n#1); 6616#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); 6093#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; 6035#L14-2 [2021-12-19 17:46:59,184 INFO L793 eck$LassoCheckResult]: Loop: 6035#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6037#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 6625#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; 6624#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 6623#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6622#L12 assume !(merge_~j~0#1 == merge_~n#1); 6061#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); 6062#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; 6035#L14-2 [2021-12-19 17:46:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash -874208526, now seen corresponding path program 1 times [2021-12-19 17:46:59,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:59,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246411928] [2021-12-19 17:46:59,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:59,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:59,194 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:59,202 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:59,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:59,203 INFO L85 PathProgramCache]: Analyzing trace with hash -695534387, now seen corresponding path program 1 times [2021-12-19 17:46:59,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:59,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826203597] [2021-12-19 17:46:59,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:59,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:59,206 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:46:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:46:59,209 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:46:59,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:46:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1629101758, now seen corresponding path program 1 times [2021-12-19 17:46:59,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:46:59,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958271871] [2021-12-19 17:46:59,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:59,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:46:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:59,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-19 17:46:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:59,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-19 17:46:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 17:46:59,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:46:59,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958271871] [2021-12-19 17:46:59,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958271871] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:46:59,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943051915] [2021-12-19 17:46:59,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:46:59,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:46:59,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:46:59,304 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:46:59,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2021-12-19 17:46:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:46:59,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-19 17:46:59,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:46:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-19 17:46:59,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:46:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-19 17:46:59,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943051915] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:46:59,710 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:46:59,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2021-12-19 17:46:59,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999173336] [2021-12-19 17:46:59,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:46:59,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:46:59,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-19 17:46:59,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-12-19 17:46:59,872 INFO L87 Difference]: Start difference. First operand 591 states and 760 transitions. cyclomatic complexity: 205 Second operand has 18 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-19 17:47:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:47:00,207 INFO L93 Difference]: Finished difference Result 1218 states and 1619 transitions. [2021-12-19 17:47:00,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-19 17:47:00,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1218 states and 1619 transitions. [2021-12-19 17:47:00,216 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 446 [2021-12-19 17:47:00,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1218 states to 1218 states and 1619 transitions. [2021-12-19 17:47:00,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 919 [2021-12-19 17:47:00,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 919 [2021-12-19 17:47:00,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1218 states and 1619 transitions. [2021-12-19 17:47:00,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:47:00,227 INFO L681 BuchiCegarLoop]: Abstraction has 1218 states and 1619 transitions. [2021-12-19 17:47:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states and 1619 transitions. [2021-12-19 17:47:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 701. [2021-12-19 17:47:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 627 states have (on average 1.2248803827751196) internal successors, (768), 629 states have internal predecessors, (768), 41 states have call successors, (48), 29 states have call predecessors, (48), 33 states have return successors, (72), 42 states have call predecessors, (72), 37 states have call successors, (72) [2021-12-19 17:47:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 888 transitions. [2021-12-19 17:47:00,246 INFO L704 BuchiCegarLoop]: Abstraction has 701 states and 888 transitions. [2021-12-19 17:47:00,246 INFO L587 BuchiCegarLoop]: Abstraction has 701 states and 888 transitions. [2021-12-19 17:47:00,246 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-19 17:47:00,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 701 states and 888 transitions. [2021-12-19 17:47:00,249 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 280 [2021-12-19 17:47:00,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:47:00,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:47:00,250 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:47:00,250 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 17:47:00,250 INFO L791 eck$LassoCheckResult]: Stem: 8160#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8128#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; 8129#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; 8132#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; 8133#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 8134#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; 8135#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 8188#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 8142#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 8183#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8341#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); 8152#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 8153#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8343#L24 assume ~n#1 < 2; 8339#merge_sortFINAL assume true; 8330#merge_sortEXIT >#87#return; 8331#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 8410#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8417#L24 assume ~n#1 < 2; 8412#merge_sortFINAL assume true; 8407#merge_sortEXIT >#89#return; 8272#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; 8404#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 8405#L12 assume !(merge_~j~0#1 == merge_~n#1); 8774#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); 8156#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; 8157#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 8779#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 8139#L12-2 [2021-12-19 17:47:00,250 INFO L793 eck$LassoCheckResult]: Loop: 8139#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; 8781#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 8780#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 8138#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; 8139#L12-2 [2021-12-19 17:47:00,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:00,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1699197556, now seen corresponding path program 1 times [2021-12-19 17:47:00,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:00,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350201856] [2021-12-19 17:47:00,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:00,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:00,274 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:00,290 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:00,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 2 times [2021-12-19 17:47:00,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:00,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898938933] [2021-12-19 17:47:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:00,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:00,295 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:00,297 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1016219225, now seen corresponding path program 1 times [2021-12-19 17:47:00,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:00,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207485406] [2021-12-19 17:47:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:00,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:00,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:00,327 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:02,269 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:47:02,270 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:47:02,270 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:47:02,270 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:47:02,270 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:47:02,270 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:02,270 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:47:02,270 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:47:02,270 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration13_Lasso [2021-12-19 17:47:02,270 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:47:02,270 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:47:02,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:02,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:03,436 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:47:03,436 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:47:03,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:03,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:03,438 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:03,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2021-12-19 17:47:03,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:03,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:03,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:03,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:03,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:03,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:03,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:03,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:03,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:03,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2021-12-19 17:47:03,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:03,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:03,467 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:03,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2021-12-19 17:47:03,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:03,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:03,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:03,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:03,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:03,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:03,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:03,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:03,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:03,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2021-12-19 17:47:03,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:03,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:03,496 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:03,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2021-12-19 17:47:03,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:03,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:03,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:03,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:03,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:03,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:03,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:03,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:03,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:03,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2021-12-19 17:47:03,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:03,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:03,520 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:03,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2021-12-19 17:47:03,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:03,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:03,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:03,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:03,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:03,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:03,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:03,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:03,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:03,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2021-12-19 17:47:03,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:03,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:03,544 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:03,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2021-12-19 17:47:03,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:03,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:03,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:03,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:03,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:03,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:47:03,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:47:03,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:03,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2021-12-19 17:47:03,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:03,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:03,595 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:03,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2021-12-19 17:47:03,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:03,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:03,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:03,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:03,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:03,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:47:03,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:47:03,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:03,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2021-12-19 17:47:03,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:03,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:03,621 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:03,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2021-12-19 17:47:03,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:03,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:03,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:03,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:03,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:03,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:47:03,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:47:03,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:03,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2021-12-19 17:47:03,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:03,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:03,647 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:03,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2021-12-19 17:47:03,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:03,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:03,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:03,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:03,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:03,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:47:03,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:47:03,695 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:47:03,733 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2021-12-19 17:47:03,734 INFO L444 ModelExtractionUtils]: 35 out of 70 variables were initially zero. Simplification set additionally 31 variables to zero. [2021-12-19 17:47:03,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:03,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:03,735 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:03,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2021-12-19 17:47:03,737 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:47:03,758 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 17:47:03,758 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:47:03,758 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~x~0#1.offset, v_rep(select #length merge_sort_merge_~x~0#1.base)_2, merge_sort_merge_~k~0#1) = -1*merge_sort_merge_~x~0#1.offset + 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_2 - 4*merge_sort_merge_~k~0#1 Supporting invariants [] [2021-12-19 17:47:03,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:03,794 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-12-19 17:47:03,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:03,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 17:47:03,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:03,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:47:03,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:47:03,938 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 [2021-12-19 17:47:03,938 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 701 states and 888 transitions. cyclomatic complexity: 247 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:47:03,995 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 701 states and 888 transitions. cyclomatic complexity: 247. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1208 states and 1520 transitions. Complement of second has 14 states. [2021-12-19 17:47:03,997 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 [2021-12-19 17:47:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:47:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2021-12-19 17:47:03,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 28 letters. Loop has 4 letters. [2021-12-19 17:47:03,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:47:03,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 32 letters. Loop has 4 letters. [2021-12-19 17:47:03,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:47:03,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 28 letters. Loop has 8 letters. [2021-12-19 17:47:03,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:47:04,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1208 states and 1520 transitions. [2021-12-19 17:47:04,011 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 254 [2021-12-19 17:47:04,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1208 states to 979 states and 1241 transitions. [2021-12-19 17:47:04,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 614 [2021-12-19 17:47:04,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 623 [2021-12-19 17:47:04,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 979 states and 1241 transitions. [2021-12-19 17:47:04,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:47:04,017 INFO L681 BuchiCegarLoop]: Abstraction has 979 states and 1241 transitions. [2021-12-19 17:47:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states and 1241 transitions. [2021-12-19 17:47:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 941. [2021-12-19 17:47:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 845 states have (on average 1.2153846153846153) internal successors, (1027), 850 states have internal predecessors, (1027), 53 states have call successors, (61), 35 states have call predecessors, (61), 43 states have return successors, (111), 55 states have call predecessors, (111), 49 states have call successors, (111) [2021-12-19 17:47:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1199 transitions. [2021-12-19 17:47:04,036 INFO L704 BuchiCegarLoop]: Abstraction has 941 states and 1199 transitions. [2021-12-19 17:47:04,036 INFO L587 BuchiCegarLoop]: Abstraction has 941 states and 1199 transitions. [2021-12-19 17:47:04,037 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-19 17:47:04,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 941 states and 1199 transitions. [2021-12-19 17:47:04,040 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 250 [2021-12-19 17:47:04,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:47:04,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:47:04,042 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:47:04,042 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:47:04,043 INFO L791 eck$LassoCheckResult]: Stem: 10244#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10199#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; 10200#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; 10210#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; 10211#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 10212#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; 10213#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 10303#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 10176#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 10265#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 10841#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); 10835#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 10839#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 10842#L24 assume ~n#1 < 2; 10840#merge_sortFINAL assume true; 10834#merge_sortEXIT >#87#return; 10836#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 10899#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 10901#L24 assume ~n#1 < 2; 10900#merge_sortFINAL assume true; 10896#merge_sortEXIT >#89#return; 10463#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; 10894#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 10887#L12 assume !(merge_~j~0#1 == merge_~n#1); 10893#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); 10892#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 10891#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 10890#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 10889#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; 10888#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 10886#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 10247#L11-4 merge_~i~0#1 := 0; 10250#L17-3 [2021-12-19 17:47:04,043 INFO L793 eck$LassoCheckResult]: Loop: 10250#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; 10249#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 10250#L17-3 [2021-12-19 17:47:04,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:04,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1503740747, now seen corresponding path program 1 times [2021-12-19 17:47:04,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:04,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784905805] [2021-12-19 17:47:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:04,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:04,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-19 17:47:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-19 17:47:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-19 17:47:04,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:47:04,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784905805] [2021-12-19 17:47:04,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784905805] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:47:04,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539128411] [2021-12-19 17:47:04,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:04,096 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:47:04,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:04,097 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:47:04,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2021-12-19 17:47:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:04,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 17:47:04,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-19 17:47:04,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:47:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-19 17:47:04,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539128411] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:47:04,286 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:47:04,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-12-19 17:47:04,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370291994] [2021-12-19 17:47:04,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:47:04,286 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:47:04,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2021-12-19 17:47:04,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:04,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935032868] [2021-12-19 17:47:04,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:04,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:04,289 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:04,291 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:04,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:47:04,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-19 17:47:04,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-19 17:47:04,341 INFO L87 Difference]: Start difference. First operand 941 states and 1199 transitions. cyclomatic complexity: 339 Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:47:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:47:04,426 INFO L93 Difference]: Finished difference Result 1596 states and 1950 transitions. [2021-12-19 17:47:04,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 17:47:04,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1596 states and 1950 transitions. [2021-12-19 17:47:04,435 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 252 [2021-12-19 17:47:04,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1596 states to 1596 states and 1950 transitions. [2021-12-19 17:47:04,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 951 [2021-12-19 17:47:04,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 951 [2021-12-19 17:47:04,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1596 states and 1950 transitions. [2021-12-19 17:47:04,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:47:04,447 INFO L681 BuchiCegarLoop]: Abstraction has 1596 states and 1950 transitions. [2021-12-19 17:47:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states and 1950 transitions. [2021-12-19 17:47:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1209. [2021-12-19 17:47:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1111 states have (on average 1.1827182718271827) internal successors, (1314), 1118 states have internal predecessors, (1314), 53 states have call successors, (61), 35 states have call predecessors, (61), 45 states have return successors, (113), 55 states have call predecessors, (113), 49 states have call successors, (113) [2021-12-19 17:47:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1488 transitions. [2021-12-19 17:47:04,513 INFO L704 BuchiCegarLoop]: Abstraction has 1209 states and 1488 transitions. [2021-12-19 17:47:04,513 INFO L587 BuchiCegarLoop]: Abstraction has 1209 states and 1488 transitions. [2021-12-19 17:47:04,513 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-19 17:47:04,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1209 states and 1488 transitions. [2021-12-19 17:47:04,517 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 250 [2021-12-19 17:47:04,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:04,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:47:04,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:47:04,519 INFO L842 BuchiCegarLoop]: 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] [2021-12-19 17:47:04,519 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:47:04,520 INFO L791 eck$LassoCheckResult]: Stem: 12997#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12960#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; 12961#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; 12968#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; 12969#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 12970#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; 12971#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 13040#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 13012#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 13028#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13341#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); 13328#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 13336#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13347#L24 assume ~n#1 < 2; 13337#merge_sortFINAL assume true; 13327#merge_sortEXIT >#87#return; 13329#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 13416#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13423#L24 assume ~n#1 < 2; 13418#merge_sortFINAL assume true; 13413#merge_sortEXIT >#89#return; 13154#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; 13411#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13410#L12 assume !(merge_~j~0#1 == merge_~n#1); 13409#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); 13408#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; 13407#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 13406#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 13405#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; 13403#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 13402#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13399#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; 13398#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; 13396#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 13397#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 13390#L11-4 merge_~i~0#1 := 0; 13009#L17-3 [2021-12-19 17:47:04,520 INFO L793 eck$LassoCheckResult]: Loop: 13009#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; 13014#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 13009#L17-3 [2021-12-19 17:47:04,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2097782888, now seen corresponding path program 1 times [2021-12-19 17:47:04,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:04,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519686232] [2021-12-19 17:47:04,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:04,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:04,534 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:04,550 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:04,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times [2021-12-19 17:47:04,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:04,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068236352] [2021-12-19 17:47:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:04,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:04,554 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:04,556 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:04,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:04,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1629691942, now seen corresponding path program 1 times [2021-12-19 17:47:04,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:04,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956215093] [2021-12-19 17:47:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:04,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:04,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:04,584 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:06,614 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:47:06,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:47:06,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:47:06,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:47:06,614 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:47:06,614 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:06,614 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:47:06,614 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:47:06,614 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration15_Lasso [2021-12-19 17:47:06,615 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:47:06,615 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:47:06,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:06,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:07,957 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:47:07,957 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:47:07,957 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:07,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:07,958 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:07,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2021-12-19 17:47:07,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:07,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:07,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:07,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:07,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:07,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:07,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:07,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:07,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:07,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2021-12-19 17:47:07,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:07,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:07,994 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:07,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2021-12-19 17:47:07,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:08,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,029 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2021-12-19 17:47:08,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2021-12-19 17:47:08,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,054 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2021-12-19 17:47:08,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:47:08,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:47:08,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2021-12-19 17:47:08,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,082 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2021-12-19 17:47:08,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2021-12-19 17:47:08,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,107 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2021-12-19 17:47:08,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:08,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,131 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2021-12-19 17:47:08,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2021-12-19 17:47:08,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,154 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2021-12-19 17:47:08,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2021-12-19 17:47:08,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,179 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2021-12-19 17:47:08,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:08,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,204 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2021-12-19 17:47:08,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2021-12-19 17:47:08,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,229 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2021-12-19 17:47:08,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2021-12-19 17:47:08,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,265 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2021-12-19 17:47:08,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2021-12-19 17:47:08,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,300 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2021-12-19 17:47:08,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2021-12-19 17:47:08,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,325 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2021-12-19 17:47:08,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2021-12-19 17:47:08,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,356 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2021-12-19 17:47:08,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2021-12-19 17:47:08,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,430 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2021-12-19 17:47:08,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2021-12-19 17:47:08,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,470 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2021-12-19 17:47:08,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2021-12-19 17:47:08,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,517 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2021-12-19 17:47:08,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:08,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:08,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:08,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:08,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2021-12-19 17:47:08,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,543 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2021-12-19 17:47:08,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:08,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:08,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:08,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:08,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:08,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:47:08,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:47:08,575 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:47:08,590 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-19 17:47:08,591 INFO L444 ModelExtractionUtils]: 40 out of 55 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-19 17:47:08,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:08,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:08,592 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:08,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2021-12-19 17:47:08,594 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:47:08,600 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 17:47:08,600 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:47:08,600 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~n#1, merge_sort_merge_~i~0#1) = 1*merge_sort_merge_~n#1 - 1*merge_sort_merge_~i~0#1 Supporting invariants [] [2021-12-19 17:47:08,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:08,675 INFO L297 tatePredicateManager]: 28 out of 28 supporting invariants were superfluous and have been removed [2021-12-19 17:47:08,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:08,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 17:47:08,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:08,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:47:08,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:47:08,848 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-19 17:47:08,848 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1209 states and 1488 transitions. cyclomatic complexity: 360 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:47:08,888 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1209 states and 1488 transitions. cyclomatic complexity: 360. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1279 states and 1585 transitions. Complement of second has 12 states. [2021-12-19 17:47:08,889 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 [2021-12-19 17:47:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:47:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2021-12-19 17:47:08,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 36 letters. Loop has 2 letters. [2021-12-19 17:47:08,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:47:08,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 38 letters. Loop has 2 letters. [2021-12-19 17:47:08,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:47:08,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 36 letters. Loop has 4 letters. [2021-12-19 17:47:08,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:47:08,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1585 transitions. [2021-12-19 17:47:08,896 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 236 [2021-12-19 17:47:08,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1168 states and 1446 transitions. [2021-12-19 17:47:08,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2021-12-19 17:47:08,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 730 [2021-12-19 17:47:08,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1168 states and 1446 transitions. [2021-12-19 17:47:08,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:47:08,903 INFO L681 BuchiCegarLoop]: Abstraction has 1168 states and 1446 transitions. [2021-12-19 17:47:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states and 1446 transitions. [2021-12-19 17:47:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1122. [2021-12-19 17:47:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1035 states have (on average 1.191304347826087) internal successors, (1233), 1042 states have internal predecessors, (1233), 47 states have call successors, (52), 29 states have call predecessors, (52), 40 states have return successors, (105), 50 states have call predecessors, (105), 44 states have call successors, (105) [2021-12-19 17:47:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1390 transitions. [2021-12-19 17:47:08,921 INFO L704 BuchiCegarLoop]: Abstraction has 1122 states and 1390 transitions. [2021-12-19 17:47:08,921 INFO L587 BuchiCegarLoop]: Abstraction has 1122 states and 1390 transitions. [2021-12-19 17:47:08,921 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-19 17:47:08,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1122 states and 1390 transitions. [2021-12-19 17:47:08,925 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 236 [2021-12-19 17:47:08,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:47:08,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:47:08,926 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:47:08,926 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:47:08,927 INFO L791 eck$LassoCheckResult]: Stem: 15733#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15699#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; 15700#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; 15706#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; 15707#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 15767#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; 15768#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 15708#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; 15709#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 15763#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 15757#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 15758#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16099#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); 16094#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 16096#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16103#L24 assume ~n#1 < 2; 16102#merge_sortFINAL assume true; 16093#merge_sortEXIT >#87#return; 15672#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 16091#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16090#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); 16085#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 16087#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16089#L24 assume ~n#1 < 2; 16088#merge_sortFINAL assume true; 16084#merge_sortEXIT >#87#return; 16023#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 16024#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16077#L24 assume ~n#1 < 2; 16078#merge_sortFINAL assume true; 16022#merge_sortEXIT >#89#return; 16021#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; 16020#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 16019#L12 assume !(merge_~j~0#1 == merge_~n#1); 16018#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); 16015#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; 16016#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 16262#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 16261#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; 15753#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 15735#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 15714#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; 15715#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; 15762#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 15975#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 15974#L11-4 merge_~i~0#1 := 0; 15973#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 15674#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 15675#L8 assume { :end_inline_merge } true; 15724#merge_sortFINAL assume true; 15720#merge_sortEXIT >#89#return; 15721#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; 16742#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 16741#L12 assume !(merge_~j~0#1 == merge_~n#1); 16739#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); 16736#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; 16737#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 16735#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 16732#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; 16730#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 16727#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 16617#L12 [2021-12-19 17:47:08,927 INFO L793 eck$LassoCheckResult]: Loop: 16617#L12 assume !(merge_~j~0#1 == merge_~n#1); 16733#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); 16716#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; 16728#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 16709#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 16708#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; 16707#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 16616#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 16617#L12 [2021-12-19 17:47:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash 750594749, now seen corresponding path program 1 times [2021-12-19 17:47:08,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:08,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788366915] [2021-12-19 17:47:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:08,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:08,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-19 17:47:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:08,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-19 17:47:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:09,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-19 17:47:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:09,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:47:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-19 17:47:09,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:47:09,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788366915] [2021-12-19 17:47:09,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788366915] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:47:09,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:09,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081174279] [2021-12-19 17:47:09,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:09,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:47:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:09,032 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:47:09,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2021-12-19 17:47:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:09,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-19 17:47:09,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-19 17:47:09,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:47:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-19 17:47:09,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081174279] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:47:09,593 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:47:09,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 15] total 27 [2021-12-19 17:47:09,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861407356] [2021-12-19 17:47:09,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:47:09,593 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:47:09,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:09,593 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2021-12-19 17:47:09,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:09,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945435373] [2021-12-19 17:47:09,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:09,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:09,597 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:09,600 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:09,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:47:09,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-19 17:47:09,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2021-12-19 17:47:09,743 INFO L87 Difference]: Start difference. First operand 1122 states and 1390 transitions. cyclomatic complexity: 345 Second operand has 27 states, 25 states have (on average 3.68) internal successors, (92), 22 states have internal predecessors, (92), 9 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2021-12-19 17:47:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:47:10,633 INFO L93 Difference]: Finished difference Result 1997 states and 2479 transitions. [2021-12-19 17:47:10,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-19 17:47:10,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1997 states and 2479 transitions. [2021-12-19 17:47:10,642 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 608 [2021-12-19 17:47:10,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1997 states to 1981 states and 2463 transitions. [2021-12-19 17:47:10,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1435 [2021-12-19 17:47:10,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1435 [2021-12-19 17:47:10,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1981 states and 2463 transitions. [2021-12-19 17:47:10,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:47:10,651 INFO L681 BuchiCegarLoop]: Abstraction has 1981 states and 2463 transitions. [2021-12-19 17:47:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states and 2463 transitions. [2021-12-19 17:47:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1331. [2021-12-19 17:47:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1234 states have (on average 1.1823338735818476) internal successors, (1459), 1237 states have internal predecessors, (1459), 56 states have call successors, (62), 31 states have call predecessors, (62), 41 states have return successors, (121), 62 states have call predecessors, (121), 53 states have call successors, (121) [2021-12-19 17:47:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1642 transitions. [2021-12-19 17:47:10,674 INFO L704 BuchiCegarLoop]: Abstraction has 1331 states and 1642 transitions. [2021-12-19 17:47:10,674 INFO L587 BuchiCegarLoop]: Abstraction has 1331 states and 1642 transitions. [2021-12-19 17:47:10,674 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-19 17:47:10,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1331 states and 1642 transitions. [2021-12-19 17:47:10,679 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 290 [2021-12-19 17:47:10,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:47:10,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:47:10,683 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:47:10,683 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:47:10,684 INFO L791 eck$LassoCheckResult]: Stem: 19353#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 19316#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; 19317#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; 19325#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; 19326#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 19382#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; 19383#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 19327#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; 19328#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 19420#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 19287#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 19374#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19641#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); 19619#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 19620#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19642#L24 assume ~n#1 < 2; 19621#merge_sortFINAL assume true; 19622#merge_sortEXIT >#87#return; 19289#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 19611#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 20267#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); 19346#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 19347#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 20143#L24 assume ~n#1 < 2; 20142#merge_sortFINAL assume true; 20140#merge_sortEXIT >#87#return; 19361#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 19362#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 20266#L24 assume ~n#1 < 2; 20230#merge_sortFINAL assume true; 20231#merge_sortEXIT >#89#return; 20265#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; 20424#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 20423#L12 assume !(merge_~j~0#1 == merge_~n#1); 20422#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); 20421#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; 20276#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 20277#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 20272#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; 20273#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 19355#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 19333#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; 19334#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; 19376#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 20232#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 20404#L11-4 merge_~i~0#1 := 0; 20403#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; 20402#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 20401#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; 20400#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 20399#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 20397#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 20395#L8 assume { :end_inline_merge } true; 20393#merge_sortFINAL assume true; 19339#merge_sortEXIT >#89#return; 19335#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; 19336#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 20604#L12 assume !(merge_~j~0#1 == merge_~n#1); 20603#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); 20601#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; 20599#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 20600#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 20595#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; 20596#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 20566#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 20567#L12 [2021-12-19 17:47:10,684 INFO L793 eck$LassoCheckResult]: Loop: 20567#L12 assume !(merge_~j~0#1 == merge_~n#1); 19310#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); 19311#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; 19283#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 19285#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 19375#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; 19367#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 19368#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 20567#L12 [2021-12-19 17:47:10,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:10,685 INFO L85 PathProgramCache]: Analyzing trace with hash 519552441, now seen corresponding path program 1 times [2021-12-19 17:47:10,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:10,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161600851] [2021-12-19 17:47:10,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:10,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:10,715 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:10,748 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:10,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times [2021-12-19 17:47:10,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:10,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750622709] [2021-12-19 17:47:10,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:10,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:10,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:10,754 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:10,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:10,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1561125229, now seen corresponding path program 2 times [2021-12-19 17:47:10,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:10,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947966657] [2021-12-19 17:47:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:10,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:10,779 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:10,805 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:21,612 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:47:21,612 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:47:21,612 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:47:21,612 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:47:21,612 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:47:21,612 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:21,612 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:47:21,612 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:47:21,612 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration17_Lasso [2021-12-19 17:47:21,612 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:47:21,612 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:47:21,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:21,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:21,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:21,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:21,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:21,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:21,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:21,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:21,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:21,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:22,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:47:23,962 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:47:23,962 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:47:23,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:23,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:23,963 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:23,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2021-12-19 17:47:23,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:23,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:23,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:23,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:23,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:23,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:23,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:23,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:23,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:23,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2021-12-19 17:47:23,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:23,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:23,986 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:23,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2021-12-19 17:47:23,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:23,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:23,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:23,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:23,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:23,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:23,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:23,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:23,994 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2021-12-19 17:47:24,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,010 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2021-12-19 17:47:24,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:24,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:24,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:24,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:24,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:24,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2021-12-19 17:47:24,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,044 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2021-12-19 17:47:24,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:24,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:24,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:24,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:24,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:24,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2021-12-19 17:47:24,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,068 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2021-12-19 17:47:24,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:24,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:24,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:24,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:24,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:24,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2021-12-19 17:47:24,096 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,097 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2021-12-19 17:47:24,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:24,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:24,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:24,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:24,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:24,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2021-12-19 17:47:24,121 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,122 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2021-12-19 17:47:24,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:24,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:24,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:24,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:24,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:24,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2021-12-19 17:47:24,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,154 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2021-12-19 17:47:24,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:24,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:24,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:24,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:24,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:24,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:24,187 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,188 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2021-12-19 17:47:24,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:24,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:24,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:24,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:24,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:24,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:24,211 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,212 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2021-12-19 17:47:24,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:24,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:24,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:24,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:24,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:24,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:24,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,236 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2021-12-19 17:47:24,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:24,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:24,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:47:24,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:47:24,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2021-12-19 17:47:24,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,276 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2021-12-19 17:47:24,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:24,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:24,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:24,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:24,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:24,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2021-12-19 17:47:24,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,300 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2021-12-19 17:47:24,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:24,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:24,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:24,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:24,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:24,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:24,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,340 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2021-12-19 17:47:24,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:47:24,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:24,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:24,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:47:24,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:47:24,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:24,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,363 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2021-12-19 17:47:24,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,370 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2021-12-19 17:47:24,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:47:24,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,378 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2021-12-19 17:47:24,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:47:24,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:47:24,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:24,406 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:24,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:24,407 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:24,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2021-12-19 17:47:24,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:47:24,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:47:24,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:47:24,414 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2021-12-19 17:47:24,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:47:24,486 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2021-12-19 17:47:24,486 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2021-12-19 17:47:25,098 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:47:27,482 INFO L443 ModelExtractionUtils]: Simplification made 88 calls to the SMT solver. [2021-12-19 17:47:27,482 INFO L444 ModelExtractionUtils]: 57 out of 199 variables were initially zero. Simplification set additionally 138 variables to zero. [2021-12-19 17:47:27,482 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:47:27,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:27,483 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:47:27,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2021-12-19 17:47:27,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:47:27,493 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2021-12-19 17:47:27,493 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:47:27,493 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length merge_sort_#in~a#1.base)_6, merge_sort_merge_~j~0#1, merge_sort_merge_~a#1.offset) = 1*v_rep(select #length merge_sort_#in~a#1.base)_6 - 4*merge_sort_merge_~j~0#1 - 1*merge_sort_merge_~a#1.offset Supporting invariants [] [2021-12-19 17:47:27,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:27,610 INFO L297 tatePredicateManager]: 31 out of 33 supporting invariants were superfluous and have been removed [2021-12-19 17:47:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:27,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-19 17:47:27,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:27,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2021-12-19 17:47:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:28,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 17:47:28,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:47:28,200 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2021-12-19 17:47:28,201 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1331 states and 1642 transitions. cyclomatic complexity: 399 Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:47:28,340 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1331 states and 1642 transitions. cyclomatic complexity: 399. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1914 states and 2316 transitions. Complement of second has 12 states. [2021-12-19 17:47:28,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 17:47:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:47:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2021-12-19 17:47:28,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 52 transitions. Stem has 65 letters. Loop has 8 letters. [2021-12-19 17:47:28,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:47:28,342 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:47:28,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:28,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-19 17:47:28,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:28,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 17:47:28,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:47:28,910 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2021-12-19 17:47:28,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1331 states and 1642 transitions. cyclomatic complexity: 399 Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:47:29,090 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1331 states and 1642 transitions. cyclomatic complexity: 399. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2190 states and 2627 transitions. Complement of second has 14 states. [2021-12-19 17:47:29,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-19 17:47:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:47:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2021-12-19 17:47:29,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 65 letters. Loop has 8 letters. [2021-12-19 17:47:29,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:47:29,093 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:47:29,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:29,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-19 17:47:29,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:29,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 17:47:29,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:47:29,674 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2021-12-19 17:47:29,675 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1331 states and 1642 transitions. cyclomatic complexity: 399 Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:47:29,818 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1331 states and 1642 transitions. cyclomatic complexity: 399. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2778 states and 3394 transitions. Complement of second has 31 states. [2021-12-19 17:47:29,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 17:47:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:47:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2021-12-19 17:47:29,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 76 transitions. Stem has 65 letters. Loop has 8 letters. [2021-12-19 17:47:29,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:47:29,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 76 transitions. Stem has 73 letters. Loop has 8 letters. [2021-12-19 17:47:29,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:47:29,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 76 transitions. Stem has 65 letters. Loop has 16 letters. [2021-12-19 17:47:29,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:47:29,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2778 states and 3394 transitions. [2021-12-19 17:47:29,833 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 228 [2021-12-19 17:47:29,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2778 states to 2165 states and 2617 transitions. [2021-12-19 17:47:29,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 840 [2021-12-19 17:47:29,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 991 [2021-12-19 17:47:29,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2165 states and 2617 transitions. [2021-12-19 17:47:29,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:47:29,845 INFO L681 BuchiCegarLoop]: Abstraction has 2165 states and 2617 transitions. [2021-12-19 17:47:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states and 2617 transitions. [2021-12-19 17:47:29,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1543. [2021-12-19 17:47:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1446 states have (on average 1.177731673582296) internal successors, (1703), 1449 states have internal predecessors, (1703), 56 states have call successors, (62), 31 states have call predecessors, (62), 41 states have return successors, (121), 62 states have call predecessors, (121), 53 states have call successors, (121) [2021-12-19 17:47:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 1886 transitions. [2021-12-19 17:47:29,867 INFO L704 BuchiCegarLoop]: Abstraction has 1543 states and 1886 transitions. [2021-12-19 17:47:29,867 INFO L587 BuchiCegarLoop]: Abstraction has 1543 states and 1886 transitions. [2021-12-19 17:47:29,867 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-19 17:47:29,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1543 states and 1886 transitions. [2021-12-19 17:47:29,871 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 166 [2021-12-19 17:47:29,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:47:29,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:47:29,872 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:47:29,872 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:47:29,872 INFO L791 eck$LassoCheckResult]: Stem: 28463#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 28423#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; 28424#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; 28428#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; 28429#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 28432#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; 28495#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 28430#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; 28431#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 28521#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 28468#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 28486#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28766#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); 28736#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 28737#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28787#L24 assume ~n#1 < 2; 28784#merge_sortFINAL assume true; 28781#merge_sortEXIT >#87#return; 28406#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 28414#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28415#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); 28733#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 28758#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28774#L24 assume ~n#1 < 2; 28773#merge_sortFINAL assume true; 28755#merge_sortEXIT >#87#return; 28446#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 28739#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 29563#L24 assume ~n#1 < 2; 29562#merge_sortFINAL assume true; 28445#merge_sortEXIT >#89#return; 28448#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; 29717#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 29714#L12 assume !(merge_~j~0#1 == merge_~n#1); 29713#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); 29710#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; 29708#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 29706#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 29704#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; 29703#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 29702#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 29701#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; 29700#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; 29695#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 29696#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 28483#L11-4 merge_~i~0#1 := 0; 28474#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; 28470#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 28471#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; 28475#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 29635#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 28405#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 28407#L8 assume { :end_inline_merge } true; 28425#merge_sortFINAL assume true; 28453#merge_sortEXIT >#89#return; 28795#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; 29809#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 29807#L12 assume !(merge_~j~0#1 == merge_~n#1); 29806#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); 29837#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 29836#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 29835#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 29834#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; 29833#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 29832#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 29680#L12 [2021-12-19 17:47:29,873 INFO L793 eck$LassoCheckResult]: Loop: 29680#L12 assume !(merge_~j~0#1 == merge_~n#1); 29812#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); 29811#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 29794#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 29791#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 29788#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; 29785#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 29679#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 29680#L12 [2021-12-19 17:47:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash 576810743, now seen corresponding path program 1 times [2021-12-19 17:47:29,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:29,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644910556] [2021-12-19 17:47:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:29,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:29,909 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:29,948 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:29,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:29,949 INFO L85 PathProgramCache]: Analyzing trace with hash 291245299, now seen corresponding path program 2 times [2021-12-19 17:47:29,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:29,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525401312] [2021-12-19 17:47:29,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:29,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:29,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:29,959 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:29,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash 607266281, now seen corresponding path program 2 times [2021-12-19 17:47:29,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:29,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447357675] [2021-12-19 17:47:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:29,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:30,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-19 17:47:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-19 17:47:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:30,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-19 17:47:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:30,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:47:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 18 proven. 47 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-19 17:47:30,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:47:30,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447357675] [2021-12-19 17:47:30,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447357675] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:47:30,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458885850] [2021-12-19 17:47:30,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:47:30,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:47:30,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:30,244 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:47:30,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2021-12-19 17:47:30,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:47:30,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:47:30,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-19 17:47:30,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 21 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-19 17:47:30,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:47:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 21 proven. 47 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-19 17:47:31,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458885850] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:47:31,508 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:47:31,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 43 [2021-12-19 17:47:31,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948444063] [2021-12-19 17:47:31,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:47:31,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:47:31,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-19 17:47:31,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1632, Unknown=0, NotChecked=0, Total=1806 [2021-12-19 17:47:31,646 INFO L87 Difference]: Start difference. First operand 1543 states and 1886 transitions. cyclomatic complexity: 455 Second operand has 43 states, 37 states have (on average 2.810810810810811) internal successors, (104), 29 states have internal predecessors, (104), 15 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2021-12-19 17:47:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:47:32,770 INFO L93 Difference]: Finished difference Result 2804 states and 3427 transitions. [2021-12-19 17:47:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-19 17:47:32,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2804 states and 3427 transitions. [2021-12-19 17:47:32,781 INFO L131 ngComponentsAnalysis]: Automaton has 77 accepting balls. 356 [2021-12-19 17:47:32,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2804 states to 2775 states and 3397 transitions. [2021-12-19 17:47:32,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1360 [2021-12-19 17:47:32,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1360 [2021-12-19 17:47:32,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2775 states and 3397 transitions. [2021-12-19 17:47:32,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:47:32,795 INFO L681 BuchiCegarLoop]: Abstraction has 2775 states and 3397 transitions. [2021-12-19 17:47:32,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states and 3397 transitions. [2021-12-19 17:47:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 1917. [2021-12-19 17:47:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1808 states have (on average 1.1675884955752212) internal successors, (2111), 1811 states have internal predecessors, (2111), 62 states have call successors, (68), 31 states have call predecessors, (68), 47 states have return successors, (152), 74 states have call predecessors, (152), 59 states have call successors, (152) [2021-12-19 17:47:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2331 transitions. [2021-12-19 17:47:32,827 INFO L704 BuchiCegarLoop]: Abstraction has 1917 states and 2331 transitions. [2021-12-19 17:47:32,827 INFO L587 BuchiCegarLoop]: Abstraction has 1917 states and 2331 transitions. [2021-12-19 17:47:32,827 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-19 17:47:32,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1917 states and 2331 transitions. [2021-12-19 17:47:32,831 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 238 [2021-12-19 17:47:32,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:47:32,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:47:32,832 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:47:32,832 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 17:47:32,832 INFO L791 eck$LassoCheckResult]: Stem: 33395#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33358#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; 33359#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; 33365#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; 33366#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 33427#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; 33428#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 33367#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; 33368#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 33442#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 33349#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 33419#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33518#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); 33494#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 33495#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33513#L24 assume ~n#1 < 2; 33514#merge_sortFINAL assume true; 33493#merge_sortEXIT >#87#return; 33352#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 33351#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33353#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); 33476#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 33477#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33970#L24 assume ~n#1 < 2; 33969#merge_sortFINAL assume true; 33961#merge_sortEXIT >#87#return; 33962#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 34667#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 34671#L24 assume ~n#1 < 2; 34669#merge_sortFINAL assume true; 34665#merge_sortEXIT >#89#return; 34666#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; 34913#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 34912#L12 assume !(merge_~j~0#1 == merge_~n#1); 34722#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); 34723#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; 34962#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 34961#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 34960#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; 34959#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 34958#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 34699#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; 34698#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; 34914#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 34896#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 34895#L11-4 merge_~i~0#1 := 0; 34894#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; 34893#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 34892#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; 34891#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 34890#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 34888#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 34886#L8 assume { :end_inline_merge } true; 34884#merge_sortFINAL assume true; 34880#merge_sortEXIT >#89#return; 34881#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; 35183#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35181#L12 assume !(merge_~j~0#1 == merge_~n#1); 35178#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); 35175#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; 35176#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 35221#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 35233#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; 35231#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 35229#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35227#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; 33372#L12-2 [2021-12-19 17:47:32,832 INFO L793 eck$LassoCheckResult]: Loop: 33372#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; 33412#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 33413#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 33371#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; 33372#L12-2 [2021-12-19 17:47:32,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:32,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1073743495, now seen corresponding path program 3 times [2021-12-19 17:47:32,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:32,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673632708] [2021-12-19 17:47:32,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:32,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:32,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-19 17:47:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:32,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-19 17:47:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-19 17:47:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:32,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:47:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-19 17:47:32,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:47:32,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673632708] [2021-12-19 17:47:32,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673632708] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:47:32,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564063892] [2021-12-19 17:47:32,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 17:47:32,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:47:32,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:32,948 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:47:32,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2021-12-19 17:47:33,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-19 17:47:33,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:47:33,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 17:47:33,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-19 17:47:33,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:47:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-19 17:47:33,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564063892] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:47:33,359 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:47:33,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2021-12-19 17:47:33,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088489970] [2021-12-19 17:47:33,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:47:33,359 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:47:33,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:33,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 3 times [2021-12-19 17:47:33,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:33,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473921581] [2021-12-19 17:47:33,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:33,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:33,362 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:33,364 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:33,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:47:33,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-19 17:47:33,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-12-19 17:47:33,452 INFO L87 Difference]: Start difference. First operand 1917 states and 2331 transitions. cyclomatic complexity: 562 Second operand has 19 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-19 17:47:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:47:33,905 INFO L93 Difference]: Finished difference Result 2709 states and 3335 transitions. [2021-12-19 17:47:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-19 17:47:33,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2709 states and 3335 transitions. [2021-12-19 17:47:33,916 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 420 [2021-12-19 17:47:33,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2709 states to 2700 states and 3326 transitions. [2021-12-19 17:47:33,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1288 [2021-12-19 17:47:33,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1288 [2021-12-19 17:47:33,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2700 states and 3326 transitions. [2021-12-19 17:47:33,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:47:33,928 INFO L681 BuchiCegarLoop]: Abstraction has 2700 states and 3326 transitions. [2021-12-19 17:47:33,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states and 3326 transitions. [2021-12-19 17:47:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2005. [2021-12-19 17:47:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1896 states have (on average 1.1787974683544304) internal successors, (2235), 1898 states have internal predecessors, (2235), 62 states have call successors, (68), 32 states have call predecessors, (68), 47 states have return successors, (152), 74 states have call predecessors, (152), 59 states have call successors, (152) [2021-12-19 17:47:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2455 transitions. [2021-12-19 17:47:33,959 INFO L704 BuchiCegarLoop]: Abstraction has 2005 states and 2455 transitions. [2021-12-19 17:47:33,960 INFO L587 BuchiCegarLoop]: Abstraction has 2005 states and 2455 transitions. [2021-12-19 17:47:33,960 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-12-19 17:47:33,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2005 states and 2455 transitions. [2021-12-19 17:47:33,966 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 238 [2021-12-19 17:47:33,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:47:33,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:47:33,967 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:47:33,967 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:47:33,967 INFO L791 eck$LassoCheckResult]: Stem: 38512#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 38474#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; 38475#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; 38478#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; 38479#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 38545#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; 38546#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 38480#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; 38481#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 38561#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 38463#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 38538#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38616#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); 38593#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 38594#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38752#L24 assume ~n#1 < 2; 38749#merge_sortFINAL assume true; 38746#merge_sortEXIT >#87#return; 38466#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 38465#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38467#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); 38606#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 38608#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38627#L24 assume ~n#1 < 2; 38620#merge_sortFINAL assume true; 38605#merge_sortEXIT >#87#return; 38591#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 38589#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38592#L24 assume ~n#1 < 2; 39664#merge_sortFINAL assume true; 39665#merge_sortEXIT >#89#return; 40053#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; 40052#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 40050#L12 assume !(merge_~j~0#1 == merge_~n#1); 40048#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); 40046#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; 40044#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 40042#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 40040#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; 40038#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 40023#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 39999#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; 40007#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; 40003#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 39998#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 39993#L11-4 merge_~i~0#1 := 0; 39988#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; 39986#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 39984#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; 39948#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 39946#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 39947#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 39939#L8 assume { :end_inline_merge } true; 39940#merge_sortFINAL assume true; 39926#merge_sortEXIT >#89#return; 38487#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; 38488#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 40391#L12 assume !(merge_~j~0#1 == merge_~n#1); 40392#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); 40388#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 40389#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 40437#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 40436#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; 40435#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 38515#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38486#L12 assume !(merge_~j~0#1 == merge_~n#1); 38462#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; 38464#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 40439#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; 38531#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 38532#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 40116#L11-4 merge_~i~0#1 := 0; 38517#L17-3 [2021-12-19 17:47:33,967 INFO L793 eck$LassoCheckResult]: Loop: 38517#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; 38516#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 38517#L17-3 [2021-12-19 17:47:33,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:33,968 INFO L85 PathProgramCache]: Analyzing trace with hash -449494681, now seen corresponding path program 1 times [2021-12-19 17:47:33,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:33,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838364987] [2021-12-19 17:47:33,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:33,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:34,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-19 17:47:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:34,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-19 17:47:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:34,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-19 17:47:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:34,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:47:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-19 17:47:34,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:47:34,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838364987] [2021-12-19 17:47:34,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838364987] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:47:34,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196319395] [2021-12-19 17:47:34,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:34,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:47:34,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:34,071 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:47:34,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2021-12-19 17:47:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:34,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 17:47:34,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-19 17:47:34,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:47:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-19 17:47:34,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196319395] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:47:34,443 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:47:34,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 17 [2021-12-19 17:47:34,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222641367] [2021-12-19 17:47:34,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:47:34,443 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:47:34,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 4 times [2021-12-19 17:47:34,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:34,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519338720] [2021-12-19 17:47:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:34,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:34,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:34,448 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:34,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:47:34,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-19 17:47:34,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2021-12-19 17:47:34,490 INFO L87 Difference]: Start difference. First operand 2005 states and 2455 transitions. cyclomatic complexity: 607 Second operand has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 15 states have internal predecessors, (79), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:47:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:47:34,673 INFO L93 Difference]: Finished difference Result 2139 states and 2611 transitions. [2021-12-19 17:47:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-19 17:47:34,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2139 states and 2611 transitions. [2021-12-19 17:47:34,682 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 238 [2021-12-19 17:47:34,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2139 states to 2127 states and 2598 transitions. [2021-12-19 17:47:34,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946 [2021-12-19 17:47:34,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946 [2021-12-19 17:47:34,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2127 states and 2598 transitions. [2021-12-19 17:47:34,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:47:34,692 INFO L681 BuchiCegarLoop]: Abstraction has 2127 states and 2598 transitions. [2021-12-19 17:47:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states and 2598 transitions. [2021-12-19 17:47:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 2041. [2021-12-19 17:47:34,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2041 states, 1932 states have (on average 1.1785714285714286) internal successors, (2277), 1934 states have internal predecessors, (2277), 62 states have call successors, (68), 32 states have call predecessors, (68), 47 states have return successors, (152), 74 states have call predecessors, (152), 59 states have call successors, (152) [2021-12-19 17:47:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2497 transitions. [2021-12-19 17:47:34,719 INFO L704 BuchiCegarLoop]: Abstraction has 2041 states and 2497 transitions. [2021-12-19 17:47:34,719 INFO L587 BuchiCegarLoop]: Abstraction has 2041 states and 2497 transitions. [2021-12-19 17:47:34,719 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-12-19 17:47:34,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2041 states and 2497 transitions. [2021-12-19 17:47:34,723 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 238 [2021-12-19 17:47:34,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:47:34,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:47:34,724 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:47:34,724 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 17:47:34,724 INFO L791 eck$LassoCheckResult]: Stem: 43173#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 43137#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; 43138#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; 43141#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; 43142#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43145#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; 43204#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43143#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; 43144#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43238#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 43104#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 43193#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43452#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); 43472#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43473#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43493#L24 assume ~n#1 < 2; 43474#merge_sortFINAL assume true; 43475#merge_sortEXIT >#87#return; 43168#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 43494#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43495#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); 43167#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43169#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 44444#L24 assume ~n#1 < 2; 44443#merge_sortFINAL assume true; 44440#merge_sortEXIT >#87#return; 44441#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 44567#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 44572#L24 assume ~n#1 < 2; 44569#merge_sortFINAL assume true; 44565#merge_sortEXIT >#89#return; 44566#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; 44850#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 44848#L12 assume !(merge_~j~0#1 == merge_~n#1); 44847#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); 44845#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; 44842#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 44839#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 44837#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; 44833#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 44828#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 44820#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; 44824#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; 44822#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 44819#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 44816#L11-4 merge_~i~0#1 := 0; 44815#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; 44814#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 44813#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; 44812#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 44811#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 44807#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 44804#L8 assume { :end_inline_merge } true; 44801#merge_sortFINAL assume true; 44798#merge_sortEXIT >#89#return; 43150#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; 43151#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43146#L12 assume !(merge_~j~0#1 == merge_~n#1); 43147#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); 45107#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; 45106#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 45101#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 45102#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; 45094#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 45095#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 45088#L12 assume !(merge_~j~0#1 == merge_~n#1); 45089#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); 45063#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; 45064#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 45016#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 45015#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; 43188#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43174#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43175#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; 45070#L12-2 [2021-12-19 17:47:34,724 INFO L793 eck$LassoCheckResult]: Loop: 45070#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; 45069#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 45067#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 45068#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; 45070#L12-2 [2021-12-19 17:47:34,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:34,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1150241861, now seen corresponding path program 4 times [2021-12-19 17:47:34,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:34,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614939717] [2021-12-19 17:47:34,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:34,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:34,747 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:34,772 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:34,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:34,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 4 times [2021-12-19 17:47:34,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:34,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922894922] [2021-12-19 17:47:34,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:34,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:34,778 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:34,780 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1746497622, now seen corresponding path program 5 times [2021-12-19 17:47:34,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:34,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501201619] [2021-12-19 17:47:34,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:34,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:34,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-19 17:47:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:34,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-19 17:47:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:34,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-19 17:47:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:34,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:47:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:47:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-19 17:47:34,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:47:34,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501201619] [2021-12-19 17:47:34,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501201619] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:47:34,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18746689] [2021-12-19 17:47:34,932 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 17:47:34,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:47:34,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:47:34,933 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:47:34,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2021-12-19 17:47:35,134 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-19 17:47:35,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:47:35,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 17:47:35,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:47:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 31 proven. 56 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-19 17:47:35,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:47:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 31 proven. 57 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-19 17:47:35,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18746689] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:47:35,701 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:47:35,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 31 [2021-12-19 17:47:35,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986035848] [2021-12-19 17:47:35,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:47:35,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:47:35,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-19 17:47:35,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2021-12-19 17:47:35,771 INFO L87 Difference]: Start difference. First operand 2041 states and 2497 transitions. cyclomatic complexity: 613 Second operand has 31 states, 29 states have (on average 4.655172413793103) internal successors, (135), 28 states have internal predecessors, (135), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-19 17:47:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:47:36,581 INFO L93 Difference]: Finished difference Result 6013 states and 7261 transitions. [2021-12-19 17:47:36,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-19 17:47:36,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6013 states and 7261 transitions. [2021-12-19 17:47:36,602 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 282 [2021-12-19 17:47:36,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6013 states to 5756 states and 6985 transitions. [2021-12-19 17:47:36,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2188 [2021-12-19 17:47:36,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3144 [2021-12-19 17:47:36,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5756 states and 6985 transitions. [2021-12-19 17:47:36,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:47:36,632 INFO L681 BuchiCegarLoop]: Abstraction has 5756 states and 6985 transitions. [2021-12-19 17:47:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5756 states and 6985 transitions. [2021-12-19 17:47:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5756 to 3193. [2021-12-19 17:47:36,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3073 states have (on average 1.1669378457533355) internal successors, (3586), 3077 states have internal predecessors, (3586), 63 states have call successors, (69), 32 states have call predecessors, (69), 57 states have return successors, (205), 83 states have call predecessors, (205), 60 states have call successors, (205) [2021-12-19 17:47:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 3860 transitions. [2021-12-19 17:47:36,696 INFO L704 BuchiCegarLoop]: Abstraction has 3193 states and 3860 transitions. [2021-12-19 17:47:36,696 INFO L587 BuchiCegarLoop]: Abstraction has 3193 states and 3860 transitions. [2021-12-19 17:47:36,696 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-12-19 17:47:36,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3193 states and 3860 transitions. [2021-12-19 17:47:36,703 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 170 [2021-12-19 17:47:36,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:47:36,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:47:36,704 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:47:36,704 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:47:36,705 INFO L791 eck$LassoCheckResult]: Stem: 51851#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 51812#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; 51813#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; 51818#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; 51819#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 51895#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; 51896#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 51820#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; 51821#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 51912#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 51857#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 51888#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51958#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); 51932#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 51933#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51978#L24 assume ~n#1 < 2; 51975#merge_sortFINAL assume true; 51972#merge_sortEXIT >#87#return; 51917#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 51971#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51916#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); 51918#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 51949#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51967#L24 assume ~n#1 < 2; 51965#merge_sortFINAL assume true; 51940#merge_sortEXIT >#87#return; 51943#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 52787#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52790#L24 assume ~n#1 < 2; 52791#merge_sortFINAL assume true; 52785#merge_sortEXIT >#89#return; 52781#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; 52782#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 52772#L12 assume !(merge_~j~0#1 == merge_~n#1); 52774#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); 52760#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; 52761#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 52750#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 52751#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; 53309#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 53307#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 52752#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; 52753#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; 52745#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 52746#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 52727#L11-4 merge_~i~0#1 := 0; 52728#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; 53261#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 53259#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; 53255#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 53253#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 53254#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 52993#L8 assume { :end_inline_merge } true; 52994#merge_sortFINAL assume true; 52848#merge_sortEXIT >#89#return; 52849#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; 53671#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 53672#L12 assume !(merge_~j~0#1 == merge_~n#1); 53666#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); 53667#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; 53661#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 53662#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 53657#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; 53658#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 53653#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 53654#L12 assume !(merge_~j~0#1 == merge_~n#1); 53649#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); 53650#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; 53644#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 53646#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 53709#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; 53708#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 53707#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 53628#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; 53627#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; 53626#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 53528#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 53527#L11-4 merge_~i~0#1 := 0; 51859#L17-3 [2021-12-19 17:47:36,705 INFO L793 eck$LassoCheckResult]: Loop: 51859#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; 51855#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 51859#L17-3 [2021-12-19 17:47:36,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1746497660, now seen corresponding path program 6 times [2021-12-19 17:47:36,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:36,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304716509] [2021-12-19 17:47:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:36,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:36,736 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:36,772 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:36,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 5 times [2021-12-19 17:47:36,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:36,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818308199] [2021-12-19 17:47:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:36,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:36,776 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:36,777 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:36,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:47:36,778 INFO L85 PathProgramCache]: Analyzing trace with hash 947963078, now seen corresponding path program 7 times [2021-12-19 17:47:36,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:47:36,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221648406] [2021-12-19 17:47:36,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:47:36,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:47:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:36,829 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:47:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:47:36,864 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:47:47,484 WARN L227 SmtUtils]: Spent 7.88s on a formula simplification. DAG size of input: 360 DAG size of output: 294 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:47:51,571 WARN L322 ript$VariableManager]: TermVariabe |aux_div_aux_mod_v_merge_sort_merge_#in~n#1_65_39_103| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-19 17:47:51,571 WARN L322 ript$VariableManager]: TermVariabe |aux_mod_aux_mod_v_merge_sort_merge_#in~n#1_65_39_103| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-19 17:47:51,571 WARN L322 ript$VariableManager]: TermVariabe |aux_div_v_merge_sort_merge_#in~n#1_65_39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-19 17:48:03,571 WARN L227 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 217 DAG size of output: 212 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:48:08,655 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:48:08,655 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:48:08,655 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:48:08,655 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:48:08,655 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:48:08,655 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:08,655 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:48:08,655 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:48:08,655 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration22_Lasso [2021-12-19 17:48:08,655 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:48:08,655 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:48:08,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:08,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:12,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:12,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:12,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:12,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:12,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:12,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:12,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:12,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:12,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:12,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:48:13,232 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:48:13,232 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:48:13,232 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,234 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2021-12-19 17:48:13,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2021-12-19 17:48:13,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,308 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2021-12-19 17:48:13,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2021-12-19 17:48:13,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,334 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2021-12-19 17:48:13,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2021-12-19 17:48:13,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,367 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2021-12-19 17:48:13,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2021-12-19 17:48:13,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,392 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2021-12-19 17:48:13,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2021-12-19 17:48:13,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,418 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2021-12-19 17:48:13,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2021-12-19 17:48:13,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,446 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2021-12-19 17:48:13,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2021-12-19 17:48:13,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,486 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2021-12-19 17:48:13,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2021-12-19 17:48:13,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,513 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2021-12-19 17:48:13,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2021-12-19 17:48:13,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,546 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2021-12-19 17:48:13,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2021-12-19 17:48:13,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,586 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2021-12-19 17:48:13,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2021-12-19 17:48:13,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,612 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2021-12-19 17:48:13,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2021-12-19 17:48:13,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,637 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2021-12-19 17:48:13,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2021-12-19 17:48:13,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,666 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2021-12-19 17:48:13,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 [2021-12-19 17:48:13,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2021-12-19 17:48:13,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,694 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2021-12-19 17:48:13,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2021-12-19 17:48:13,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,734 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2021-12-19 17:48:13,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2021-12-19 17:48:13,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,763 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2021-12-19 17:48:13,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 [2021-12-19 17:48:13,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2021-12-19 17:48:13,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,789 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2021-12-19 17:48:13,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:48:13,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:48:13,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2021-12-19 17:48:13,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,823 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2021-12-19 17:48:13,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2021-12-19 17:48:13,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,863 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2021-12-19 17:48:13,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2021-12-19 17:48:13,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,902 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2021-12-19 17:48:13,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2021-12-19 17:48:13,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,929 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2021-12-19 17:48:13,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:13,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2021-12-19 17:48:13,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:13,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:13,970 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:13,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2021-12-19 17:48:13,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:13,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:13,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:13,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:13,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:13,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:13,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:13,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:13,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:14,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2021-12-19 17:48:14,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:14,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:14,002 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:14,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2021-12-19 17:48:14,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:14,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:14,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:14,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:14,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:14,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:48:14,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:48:14,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:14,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2021-12-19 17:48:14,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:14,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:14,070 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:14,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2021-12-19 17:48:14,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:14,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:14,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:14,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:14,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:14,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:14,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:14,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:14,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:14,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2021-12-19 17:48:14,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:14,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:14,109 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:14,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2021-12-19 17:48:14,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 [2021-12-19 17:48:14,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:14,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:14,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:14,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:14,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:48:14,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:48:14,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:14,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2021-12-19 17:48:14,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:14,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:14,150 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:14,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2021-12-19 17:48:14,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:14,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:14,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:48:14,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:14,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:14,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:14,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:48:14,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:48:14,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:48:14,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Forceful destruction successful, exit code 0 [2021-12-19 17:48:14,189 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:14,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:14,190 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:14,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2021-12-19 17:48:14,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:48:14,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:48:14,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:48:14,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:48:14,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:48:14,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:48:14,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:48:14,230 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:48:14,339 INFO L443 ModelExtractionUtils]: Simplification made 44 calls to the SMT solver. [2021-12-19 17:48:14,340 INFO L444 ModelExtractionUtils]: 16 out of 64 variables were initially zero. Simplification set additionally 43 variables to zero. [2021-12-19 17:48:14,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:48:14,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:14,341 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:48:14,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2021-12-19 17:48:14,343 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:48:14,351 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-19 17:48:14,352 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:48:14,352 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select old(#length) merge_sort_merge_~a#1.base)_5, merge_sort_merge_~i~0#1) = 1*v_rep(select old(#length) merge_sort_merge_~a#1.base)_5 - 2*merge_sort_merge_~i~0#1 Supporting invariants [1*v_rep(select old(#length) merge_sort_#in~a#1.base)_7 - 2*merge_sort_merge_~n#1 >= 0] [2021-12-19 17:48:14,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Forceful destruction successful, exit code 0 [2021-12-19 17:48:14,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2021-12-19 17:48:14,678 INFO L297 tatePredicateManager]: 64 out of 66 supporting invariants were superfluous and have been removed [2021-12-19 17:48:14,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:14,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-19 17:48:14,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:48:14,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:48:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:15,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 17:48:15,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:48:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:48:15,470 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2021-12-19 17:48:15,470 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3193 states and 3860 transitions. cyclomatic complexity: 768 Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:48:15,690 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3193 states and 3860 transitions. cyclomatic complexity: 768. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 3270 states and 3956 transitions. Complement of second has 12 states. [2021-12-19 17:48:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 8 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 17:48:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:48:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2021-12-19 17:48:15,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 78 letters. Loop has 2 letters. [2021-12-19 17:48:15,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:48:15,692 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:48:15,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:15,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-19 17:48:15,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:48:15,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:48:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:16,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 17:48:16,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:48:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:48:16,470 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2021-12-19 17:48:16,471 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3193 states and 3860 transitions. cyclomatic complexity: 768 Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:48:16,710 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3193 states and 3860 transitions. cyclomatic complexity: 768. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 3270 states and 3956 transitions. Complement of second has 12 states. [2021-12-19 17:48:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 8 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 17:48:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:48:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2021-12-19 17:48:16,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 78 letters. Loop has 2 letters. [2021-12-19 17:48:16,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:48:16,712 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:48:16,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:16,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-19 17:48:16,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:48:16,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:48:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:17,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 17:48:17,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:48:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:48:17,458 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2021-12-19 17:48:17,458 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3193 states and 3860 transitions. cyclomatic complexity: 768 Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:48:17,761 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3193 states and 3860 transitions. cyclomatic complexity: 768. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 3626 states and 4384 transitions. Complement of second has 15 states. [2021-12-19 17:48:17,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 9 stem states 1 non-accepting loop states 2 accepting loop states [2021-12-19 17:48:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:48:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2021-12-19 17:48:17,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 65 transitions. Stem has 78 letters. Loop has 2 letters. [2021-12-19 17:48:17,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:48:17,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 65 transitions. Stem has 80 letters. Loop has 2 letters. [2021-12-19 17:48:17,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:48:17,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 65 transitions. Stem has 78 letters. Loop has 4 letters. [2021-12-19 17:48:17,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:48:17,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3626 states and 4384 transitions. [2021-12-19 17:48:17,776 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 202 [2021-12-19 17:48:17,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3626 states to 3304 states and 4009 transitions. [2021-12-19 17:48:17,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2118 [2021-12-19 17:48:17,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2146 [2021-12-19 17:48:17,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3304 states and 4009 transitions. [2021-12-19 17:48:17,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:48:17,805 INFO L681 BuchiCegarLoop]: Abstraction has 3304 states and 4009 transitions. [2021-12-19 17:48:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3304 states and 4009 transitions. [2021-12-19 17:48:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3304 to 3104. [2021-12-19 17:48:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3104 states, 2989 states have (on average 1.1699565071930411) internal successors, (3497), 2992 states have internal predecessors, (3497), 61 states have call successors, (67), 29 states have call predecessors, (67), 54 states have return successors, (213), 82 states have call predecessors, (213), 59 states have call successors, (213) [2021-12-19 17:48:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 3777 transitions. [2021-12-19 17:48:17,862 INFO L704 BuchiCegarLoop]: Abstraction has 3104 states and 3777 transitions. [2021-12-19 17:48:17,862 INFO L587 BuchiCegarLoop]: Abstraction has 3104 states and 3777 transitions. [2021-12-19 17:48:17,862 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-12-19 17:48:17,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3104 states and 3777 transitions. [2021-12-19 17:48:17,869 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 180 [2021-12-19 17:48:17,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:48:17,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:48:17,870 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:48:17,870 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:48:17,870 INFO L791 eck$LassoCheckResult]: Stem: 66323#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 66289#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; 66290#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; 66294#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; 66295#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 66360#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; 66298#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 66299#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; 66361#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 66296#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; 66297#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 66358#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 66252#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 66374#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 66373#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); 66368#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 66372#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 66383#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); 66334#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 66369#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 66380#L24 assume ~n#1 < 2; 66381#merge_sortFINAL assume true; 66366#merge_sortEXIT >#87#return; 66347#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 66419#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 66346#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); 66285#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 66535#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 66536#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); 66583#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 66588#merge_sortENTRY [2021-12-19 17:48:17,870 INFO L793 eck$LassoCheckResult]: Loop: 66588#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 66590#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); 66585#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 66588#merge_sortENTRY [2021-12-19 17:48:17,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:17,871 INFO L85 PathProgramCache]: Analyzing trace with hash 11293888, now seen corresponding path program 4 times [2021-12-19 17:48:17,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:17,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90546166] [2021-12-19 17:48:17,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:17,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:18,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-19 17:48:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 17:48:18,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:48:18,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90546166] [2021-12-19 17:48:18,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90546166] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:48:18,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400525958] [2021-12-19 17:48:18,014 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 17:48:18,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:48:18,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:18,015 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:48:18,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Waiting until timeout for monitored process [2021-12-19 17:48:18,110 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 17:48:18,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:48:18,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-19 17:48:18,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:48:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 17:48:18,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:48:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 17:48:18,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400525958] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:48:18,333 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:48:18,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 24 [2021-12-19 17:48:18,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224530391] [2021-12-19 17:48:18,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:48:18,333 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:48:18,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 5 times [2021-12-19 17:48:18,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:18,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044338295] [2021-12-19 17:48:18,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:18,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:18,338 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:48:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:18,341 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:48:18,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:48:18,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-19 17:48:18,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2021-12-19 17:48:18,438 INFO L87 Difference]: Start difference. First operand 3104 states and 3777 transitions. cyclomatic complexity: 777 Second operand has 24 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 states have internal predecessors, (35), 7 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 17:48:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:48:18,841 INFO L93 Difference]: Finished difference Result 3308 states and 4014 transitions. [2021-12-19 17:48:18,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-19 17:48:18,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3308 states and 4014 transitions. [2021-12-19 17:48:18,877 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 204 [2021-12-19 17:48:18,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3308 states to 3305 states and 4011 transitions. [2021-12-19 17:48:18,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2134 [2021-12-19 17:48:18,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2142 [2021-12-19 17:48:18,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3305 states and 4011 transitions. [2021-12-19 17:48:18,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:48:18,894 INFO L681 BuchiCegarLoop]: Abstraction has 3305 states and 4011 transitions. [2021-12-19 17:48:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states and 4011 transitions. [2021-12-19 17:48:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3193. [2021-12-19 17:48:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3070 states have (on average 1.1684039087947882) internal successors, (3587), 3075 states have internal predecessors, (3587), 65 states have call successors, (71), 33 states have call predecessors, (71), 58 states have return successors, (217), 84 states have call predecessors, (217), 62 states have call successors, (217) [2021-12-19 17:48:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 3875 transitions. [2021-12-19 17:48:18,940 INFO L704 BuchiCegarLoop]: Abstraction has 3193 states and 3875 transitions. [2021-12-19 17:48:18,940 INFO L587 BuchiCegarLoop]: Abstraction has 3193 states and 3875 transitions. [2021-12-19 17:48:18,940 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-12-19 17:48:18,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3193 states and 3875 transitions. [2021-12-19 17:48:18,950 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 180 [2021-12-19 17:48:18,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:48:18,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:48:18,951 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:48:18,951 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:48:18,952 INFO L791 eck$LassoCheckResult]: Stem: 72978#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 72939#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; 72940#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; 72945#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; 72946#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 73008#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; 72949#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 72950#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; 73009#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 72947#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; 72948#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 73007#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; 73050#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 73049#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; 73048#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 73047#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 72907#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 73046#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 72992#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); 72933#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 72931#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 72934#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); 73035#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 73038#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 73041#L24 assume ~n#1 < 2; 73042#merge_sortFINAL assume true; 73033#merge_sortEXIT >#87#return; 73036#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 73688#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 74179#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); 72963#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 73028#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 73678#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); 72971#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 72974#merge_sortENTRY [2021-12-19 17:48:18,952 INFO L793 eck$LassoCheckResult]: Loop: 72974#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 73680#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); 72970#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 72974#merge_sortENTRY [2021-12-19 17:48:18,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1909553148, now seen corresponding path program 5 times [2021-12-19 17:48:18,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:18,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824145181] [2021-12-19 17:48:18,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:18,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:19,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-19 17:48:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 19 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:48:19,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:48:19,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824145181] [2021-12-19 17:48:19,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824145181] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:48:19,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116876719] [2021-12-19 17:48:19,180 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 17:48:19,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:48:19,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:19,196 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:48:19,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Waiting until timeout for monitored process [2021-12-19 17:48:19,329 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-12-19 17:48:19,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:48:19,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 17:48:19,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:48:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-19 17:48:19,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:48:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-19 17:48:19,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116876719] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:48:19,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:48:19,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10, 10] total 28 [2021-12-19 17:48:19,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634460065] [2021-12-19 17:48:19,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:48:19,589 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:48:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:19,590 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 6 times [2021-12-19 17:48:19,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:19,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970611742] [2021-12-19 17:48:19,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:19,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:19,593 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:48:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:19,596 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:48:19,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:48:19,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-19 17:48:19,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2021-12-19 17:48:19,707 INFO L87 Difference]: Start difference. First operand 3193 states and 3875 transitions. cyclomatic complexity: 787 Second operand has 28 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 22 states have internal predecessors, (41), 10 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 17:48:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:48:20,374 INFO L93 Difference]: Finished difference Result 2079 states and 2570 transitions. [2021-12-19 17:48:20,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-19 17:48:20,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2079 states and 2570 transitions. [2021-12-19 17:48:20,382 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 220 [2021-12-19 17:48:20,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2079 states to 2048 states and 2534 transitions. [2021-12-19 17:48:20,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1480 [2021-12-19 17:48:20,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1489 [2021-12-19 17:48:20,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2048 states and 2534 transitions. [2021-12-19 17:48:20,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:48:20,389 INFO L681 BuchiCegarLoop]: Abstraction has 2048 states and 2534 transitions. [2021-12-19 17:48:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states and 2534 transitions. [2021-12-19 17:48:20,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1273. [2021-12-19 17:48:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1211 states have (on average 1.166804293971924) internal successors, (1413), 1208 states have internal predecessors, (1413), 39 states have call successors, (41), 25 states have call predecessors, (41), 23 states have return successors, (89), 39 states have call predecessors, (89), 36 states have call successors, (89) [2021-12-19 17:48:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1543 transitions. [2021-12-19 17:48:20,406 INFO L704 BuchiCegarLoop]: Abstraction has 1273 states and 1543 transitions. [2021-12-19 17:48:20,406 INFO L587 BuchiCegarLoop]: Abstraction has 1273 states and 1543 transitions. [2021-12-19 17:48:20,406 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-12-19 17:48:20,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1273 states and 1543 transitions. [2021-12-19 17:48:20,409 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 84 [2021-12-19 17:48:20,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:48:20,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:48:20,409 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:48:20,409 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:48:20,409 INFO L791 eck$LassoCheckResult]: Stem: 78512#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 78488#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; 78489#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; 78491#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; 78492#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 78493#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; 78494#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 78495#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; 78555#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 78554#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; 78553#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 78552#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 78500#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 78539#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 78650#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); 78603#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 78649#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 78647#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); 78644#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 78645#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 78648#L24 assume ~n#1 < 2; 78646#merge_sortFINAL assume true; 78643#merge_sortEXIT >#87#return; 78602#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 78604#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 78609#L24 assume ~n#1 < 2; 78605#merge_sortFINAL assume true; 78606#merge_sortEXIT >#89#return; 78642#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; 78778#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 78776#L12 assume !(merge_~j~0#1 == merge_~n#1); 78774#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); 78772#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; 78770#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 78768#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 78766#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; 78764#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 78756#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 78752#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; 78749#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; 78746#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 78741#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 78740#L11-4 merge_~i~0#1 := 0; 78739#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; 78738#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 78737#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 78736#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 78735#L8 assume { :end_inline_merge } true; 78734#merge_sortFINAL assume true; 78733#merge_sortEXIT >#87#return; 78506#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 78731#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 78730#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); 78700#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 78698#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 78702#L24 assume ~n#1 < 2; 78721#merge_sortFINAL assume true; 78722#merge_sortEXIT >#87#return; 78705#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 78727#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 78723#L24 assume ~n#1 < 2; 78724#merge_sortFINAL assume true; 79169#merge_sortEXIT >#89#return; 79170#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; 79360#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 79359#L12 assume !(merge_~j~0#1 == merge_~n#1); 79358#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); 79356#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; 79357#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 79368#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 79367#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; 79365#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 79155#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 79156#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; 79173#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; 79174#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 79157#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 79146#L11-4 merge_~i~0#1 := 0; 79145#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; 79144#L17-2 [2021-12-19 17:48:20,410 INFO L793 eck$LassoCheckResult]: Loop: 79144#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 79143#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; 79144#L17-2 [2021-12-19 17:48:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1095523269, now seen corresponding path program 8 times [2021-12-19 17:48:20,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:20,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211229897] [2021-12-19 17:48:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:20,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:20,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-19 17:48:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:20,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-19 17:48:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:20,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:48:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-19 17:48:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:20,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-19 17:48:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 58 proven. 19 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-19 17:48:20,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:48:20,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211229897] [2021-12-19 17:48:20,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211229897] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:48:20,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242917771] [2021-12-19 17:48:20,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:48:20,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:48:20,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:20,506 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:48:20,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (181)] Waiting until timeout for monitored process [2021-12-19 17:48:20,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:48:20,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:48:20,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 17:48:20,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:48:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-19 17:48:20,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:48:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 46 proven. 9 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-19 17:48:20,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242917771] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:48:20,845 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:48:20,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 15 [2021-12-19 17:48:20,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753547573] [2021-12-19 17:48:20,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:48:20,846 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:48:20,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 6 times [2021-12-19 17:48:20,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:20,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168530734] [2021-12-19 17:48:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:20,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:20,850 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:48:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:20,853 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:48:20,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:48:20,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-19 17:48:20,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-12-19 17:48:20,905 INFO L87 Difference]: Start difference. First operand 1273 states and 1543 transitions. cyclomatic complexity: 316 Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-19 17:48:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:48:21,142 INFO L93 Difference]: Finished difference Result 2126 states and 2551 transitions. [2021-12-19 17:48:21,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-19 17:48:21,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2126 states and 2551 transitions. [2021-12-19 17:48:21,150 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 144 [2021-12-19 17:48:21,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2126 states to 2126 states and 2551 transitions. [2021-12-19 17:48:21,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1627 [2021-12-19 17:48:21,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1627 [2021-12-19 17:48:21,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2126 states and 2551 transitions. [2021-12-19 17:48:21,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:48:21,157 INFO L681 BuchiCegarLoop]: Abstraction has 2126 states and 2551 transitions. [2021-12-19 17:48:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states and 2551 transitions. [2021-12-19 17:48:21,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 1301. [2021-12-19 17:48:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 1239 states have (on average 1.1630347054075867) internal successors, (1441), 1236 states have internal predecessors, (1441), 39 states have call successors, (41), 25 states have call predecessors, (41), 23 states have return successors, (89), 39 states have call predecessors, (89), 36 states have call successors, (89) [2021-12-19 17:48:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1571 transitions. [2021-12-19 17:48:21,174 INFO L704 BuchiCegarLoop]: Abstraction has 1301 states and 1571 transitions. [2021-12-19 17:48:21,174 INFO L587 BuchiCegarLoop]: Abstraction has 1301 states and 1571 transitions. [2021-12-19 17:48:21,174 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-12-19 17:48:21,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1301 states and 1571 transitions. [2021-12-19 17:48:21,177 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 84 [2021-12-19 17:48:21,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:48:21,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:48:21,177 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:48:21,178 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:48:21,178 INFO L791 eck$LassoCheckResult]: Stem: 82471#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 82448#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; 82449#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; 82451#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; 82452#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 82453#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; 82454#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 82455#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; 82511#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 82510#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; 82509#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 82508#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 82430#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 82496#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82832#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); 82514#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 82513#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82515#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); 82517#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 82830#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82894#L24 assume ~n#1 < 2; 82893#merge_sortFINAL assume true; 82516#merge_sortEXIT >#87#return; 82518#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 82888#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82892#L24 assume ~n#1 < 2; 82890#merge_sortFINAL assume true; 82887#merge_sortEXIT >#89#return; 82885#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; 82882#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 82880#L12 assume !(merge_~j~0#1 == merge_~n#1); 82877#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); 82875#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; 82871#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 82869#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 82867#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; 82865#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 82862#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 82863#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; 82868#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; 82866#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 82864#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 82856#L11-4 merge_~i~0#1 := 0; 82853#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; 82852#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 82851#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; 82850#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 82849#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 82848#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 82847#L8 assume { :end_inline_merge } true; 82846#merge_sortFINAL assume true; 82838#merge_sortEXIT >#87#return; 82485#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 82845#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82841#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); 82834#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 82839#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82842#L24 assume ~n#1 < 2; 82840#merge_sortFINAL assume true; 82833#merge_sortEXIT >#87#return; 82436#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 82486#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82843#L24 assume ~n#1 < 2; 82844#merge_sortFINAL assume true; 83387#merge_sortEXIT >#89#return; 83386#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; 83385#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 83383#L12 assume !(merge_~j~0#1 == merge_~n#1); 83382#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); 83380#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; 83379#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 83378#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 83377#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; 83376#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 83374#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 83375#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; 83393#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; 83388#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 83389#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 83166#L11-4 merge_~i~0#1 := 0; 83165#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; 83164#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 83163#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; 83159#L17-2 [2021-12-19 17:48:21,178 INFO L793 eck$LassoCheckResult]: Loop: 83159#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 83158#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; 83159#L17-2 [2021-12-19 17:48:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1454807867, now seen corresponding path program 9 times [2021-12-19 17:48:21,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:21,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938316095] [2021-12-19 17:48:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:21,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:21,202 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:48:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:21,226 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:48:21,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 7 times [2021-12-19 17:48:21,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:21,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764780400] [2021-12-19 17:48:21,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:21,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:21,230 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:48:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:21,232 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:48:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2088979971, now seen corresponding path program 10 times [2021-12-19 17:48:21,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:21,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913833295] [2021-12-19 17:48:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:21,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:21,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-19 17:48:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:21,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-19 17:48:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:48:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:21,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-19 17:48:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:21,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-19 17:48:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 51 proven. 43 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-19 17:48:21,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:48:21,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913833295] [2021-12-19 17:48:21,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913833295] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:48:21,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890209334] [2021-12-19 17:48:21,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 17:48:21,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:48:21,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:21,509 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:48:21,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Waiting until timeout for monitored process [2021-12-19 17:48:21,649 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 17:48:21,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:48:21,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-19 17:48:21,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:48:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-19 17:48:21,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:48:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-19 17:48:22,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890209334] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:48:22,032 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:48:22,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 30 [2021-12-19 17:48:22,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588202814] [2021-12-19 17:48:22,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:48:22,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:48:22,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-19 17:48:22,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2021-12-19 17:48:22,075 INFO L87 Difference]: Start difference. First operand 1301 states and 1571 transitions. cyclomatic complexity: 316 Second operand has 31 states, 26 states have (on average 3.923076923076923) internal successors, (102), 26 states have internal predecessors, (102), 9 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2021-12-19 17:48:23,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:48:23,000 INFO L93 Difference]: Finished difference Result 1644 states and 1945 transitions. [2021-12-19 17:48:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-19 17:48:23,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1644 states and 1945 transitions. [2021-12-19 17:48:23,006 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 104 [2021-12-19 17:48:23,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1644 states to 1560 states and 1853 transitions. [2021-12-19 17:48:23,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1274 [2021-12-19 17:48:23,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2021-12-19 17:48:23,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1560 states and 1853 transitions. [2021-12-19 17:48:23,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:48:23,011 INFO L681 BuchiCegarLoop]: Abstraction has 1560 states and 1853 transitions. [2021-12-19 17:48:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states and 1853 transitions. [2021-12-19 17:48:23,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1468. [2021-12-19 17:48:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1393 states have (on average 1.1550610193826274) internal successors, (1609), 1391 states have internal predecessors, (1609), 46 states have call successors, (48), 32 states have call predecessors, (48), 29 states have return successors, (95), 44 states have call predecessors, (95), 42 states have call successors, (95) [2021-12-19 17:48:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1752 transitions. [2021-12-19 17:48:23,024 INFO L704 BuchiCegarLoop]: Abstraction has 1468 states and 1752 transitions. [2021-12-19 17:48:23,025 INFO L587 BuchiCegarLoop]: Abstraction has 1468 states and 1752 transitions. [2021-12-19 17:48:23,025 INFO L425 BuchiCegarLoop]: ======== Iteration 27============ [2021-12-19 17:48:23,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1468 states and 1752 transitions. [2021-12-19 17:48:23,028 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 84 [2021-12-19 17:48:23,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:48:23,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:48:23,028 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:48:23,028 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:48:23,029 INFO L791 eck$LassoCheckResult]: Stem: 86059#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 86037#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; 86038#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; 86040#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; 86041#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 86042#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; 86043#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 86044#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; 86097#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 86096#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; 86095#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 86094#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; 86093#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 86092#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; 86091#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 86090#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 86019#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 86188#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86187#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); 86180#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 86186#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86184#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); 86179#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 86181#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86185#L24 assume ~n#1 < 2; 86183#merge_sortFINAL assume true; 86178#merge_sortEXIT >#87#return; 86068#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 86176#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86174#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); 86170#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 86171#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86175#L24 assume ~n#1 < 2; 86173#merge_sortFINAL assume true; 86169#merge_sortEXIT >#87#return; 86166#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 86167#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86172#L24 assume ~n#1 < 2; 86168#merge_sortFINAL assume true; 86165#merge_sortEXIT >#89#return; 86164#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; 86163#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 86161#L12 assume !(merge_~j~0#1 == merge_~n#1); 86160#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); 86157#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; 86158#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 86545#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 86544#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; 86543#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 86542#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 86541#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; 86119#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; 86120#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 86112#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 86104#L11-4 merge_~i~0#1 := 0; 86098#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; 86099#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 86072#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; 86067#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 86070#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 86609#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 86608#L8 assume { :end_inline_merge } true; 86607#merge_sortFINAL assume true; 86606#merge_sortEXIT >#89#return; 86391#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; 86635#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 86633#L12 assume !(merge_~j~0#1 == merge_~n#1); 86632#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); 86630#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 86631#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 86751#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 86750#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; 86749#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 86748#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 86747#L12 assume !(merge_~j~0#1 == merge_~n#1); 86744#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; 86743#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 86576#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; 86577#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 86302#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 86300#L11-4 merge_~i~0#1 := 0; 86298#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; 86297#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 86294#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; 86291#L17-2 [2021-12-19 17:48:23,029 INFO L793 eck$LassoCheckResult]: Loop: 86291#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 86290#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; 86291#L17-2 [2021-12-19 17:48:23,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:23,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2105946361, now seen corresponding path program 2 times [2021-12-19 17:48:23,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:23,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80170511] [2021-12-19 17:48:23,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:23,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:23,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-19 17:48:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:23,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-19 17:48:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:23,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-19 17:48:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:23,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:48:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-12-19 17:48:23,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:48:23,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80170511] [2021-12-19 17:48:23,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80170511] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:48:23,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790097268] [2021-12-19 17:48:23,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:48:23,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:48:23,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:23,189 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:48:23,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (183)] Waiting until timeout for monitored process [2021-12-19 17:48:23,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:48:23,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:48:23,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-19 17:48:23,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:48:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 57 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-19 17:48:23,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:48:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 57 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-19 17:48:23,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790097268] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:48:23,899 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:48:23,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 29 [2021-12-19 17:48:23,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827005505] [2021-12-19 17:48:23,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:48:23,900 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:48:23,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 8 times [2021-12-19 17:48:23,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:23,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662518890] [2021-12-19 17:48:23,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:23,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:23,904 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:48:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:23,907 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:48:23,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:48:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-19 17:48:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2021-12-19 17:48:23,952 INFO L87 Difference]: Start difference. First operand 1468 states and 1752 transitions. cyclomatic complexity: 330 Second operand has 29 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 23 states have internal predecessors, (96), 8 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-19 17:48:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:48:25,005 INFO L93 Difference]: Finished difference Result 3022 states and 3508 transitions. [2021-12-19 17:48:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-19 17:48:25,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3022 states and 3508 transitions. [2021-12-19 17:48:25,015 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 148 [2021-12-19 17:48:25,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3022 states to 2963 states and 3449 transitions. [2021-12-19 17:48:25,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1971 [2021-12-19 17:48:25,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1971 [2021-12-19 17:48:25,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2963 states and 3449 transitions. [2021-12-19 17:48:25,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:48:25,024 INFO L681 BuchiCegarLoop]: Abstraction has 2963 states and 3449 transitions. [2021-12-19 17:48:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states and 3449 transitions. [2021-12-19 17:48:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1893. [2021-12-19 17:48:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1809 states have (on average 1.1520176893311223) internal successors, (2084), 1808 states have internal predecessors, (2084), 52 states have call successors, (54), 34 states have call predecessors, (54), 32 states have return successors, (101), 50 states have call predecessors, (101), 48 states have call successors, (101) [2021-12-19 17:48:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2239 transitions. [2021-12-19 17:48:25,044 INFO L704 BuchiCegarLoop]: Abstraction has 1893 states and 2239 transitions. [2021-12-19 17:48:25,044 INFO L587 BuchiCegarLoop]: Abstraction has 1893 states and 2239 transitions. [2021-12-19 17:48:25,044 INFO L425 BuchiCegarLoop]: ======== Iteration 28============ [2021-12-19 17:48:25,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1893 states and 2239 transitions. [2021-12-19 17:48:25,048 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 116 [2021-12-19 17:48:25,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:48:25,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:48:25,048 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:48:25,048 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:48:25,049 INFO L791 eck$LassoCheckResult]: Stem: 91196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 91174#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; 91175#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; 91177#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; 91178#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 91179#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; 91180#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 91181#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; 91230#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 91229#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; 91228#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 91227#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; 91226#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 91225#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 91147#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 91311#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 91310#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); 91279#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 91308#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 91326#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); 91303#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 91312#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 91313#L24 assume ~n#1 < 2; 91302#merge_sortFINAL assume true; 91304#merge_sortEXIT >#87#return; 91278#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 91280#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 91285#L24 assume ~n#1 < 2; 91281#merge_sortFINAL assume true; 91282#merge_sortEXIT >#89#return; 91330#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; 91504#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 91502#L12 assume !(merge_~j~0#1 == merge_~n#1); 91500#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); 91498#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; 91496#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 91494#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 91492#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; 91490#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 91482#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 91478#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; 91475#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; 91472#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 91467#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 91466#L11-4 merge_~i~0#1 := 0; 91465#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; 91464#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 91463#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; 91462#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 91461#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 91460#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 91459#L8 assume { :end_inline_merge } true; 91458#merge_sortFINAL assume true; 91457#merge_sortEXIT >#87#return; 91385#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 91455#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 91454#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); 91384#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 91386#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 91420#L24 assume ~n#1 < 2; 91419#merge_sortFINAL assume true; 91406#merge_sortEXIT >#87#return; 91189#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 91425#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 91423#L24 assume ~n#1 < 2; 91424#merge_sortFINAL assume true; 92160#merge_sortEXIT >#89#return; 92389#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; 92387#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 92384#L12 assume !(merge_~j~0#1 == merge_~n#1); 92382#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); 92379#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; 92380#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 92400#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 92399#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; 92397#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 92360#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 92358#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; 92357#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; 92356#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 92355#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 92183#L11-4 merge_~i~0#1 := 0; 92180#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; 92177#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 92176#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; 92175#L17-2 [2021-12-19 17:48:25,049 INFO L793 eck$LassoCheckResult]: Loop: 92175#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 92174#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; 92175#L17-2 [2021-12-19 17:48:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash -363822553, now seen corresponding path program 11 times [2021-12-19 17:48:25,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:25,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965715561] [2021-12-19 17:48:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:25,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:25,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-19 17:48:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:25,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-19 17:48:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:25,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:48:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:25,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-19 17:48:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:25,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-19 17:48:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:48:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 68 proven. 38 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-19 17:48:25,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:48:25,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965715561] [2021-12-19 17:48:25,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965715561] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:48:25,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014094584] [2021-12-19 17:48:25,219 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 17:48:25,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:48:25,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:48:25,232 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:48:25,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (184)] Waiting until timeout for monitored process [2021-12-19 17:48:25,569 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-12-19 17:48:25,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:48:25,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-19 17:48:25,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:48:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 41 proven. 74 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-19 17:48:25,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:48:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 47 proven. 68 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-19 17:48:26,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014094584] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:48:26,173 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:48:26,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 21] total 33 [2021-12-19 17:48:26,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883919176] [2021-12-19 17:48:26,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:48:26,174 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:48:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:26,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 9 times [2021-12-19 17:48:26,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:26,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117166806] [2021-12-19 17:48:26,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:26,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:26,177 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:48:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:26,179 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:48:26,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:48:26,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-19 17:48:26,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2021-12-19 17:48:26,224 INFO L87 Difference]: Start difference. First operand 1893 states and 2239 transitions. cyclomatic complexity: 401 Second operand has 33 states, 28 states have (on average 4.0) internal successors, (112), 23 states have internal predecessors, (112), 13 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2021-12-19 17:48:27,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:48:27,297 INFO L93 Difference]: Finished difference Result 2246 states and 2627 transitions. [2021-12-19 17:48:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-19 17:48:27,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2246 states and 2627 transitions. [2021-12-19 17:48:27,305 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 220 [2021-12-19 17:48:27,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2246 states to 2244 states and 2625 transitions. [2021-12-19 17:48:27,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1708 [2021-12-19 17:48:27,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1708 [2021-12-19 17:48:27,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2244 states and 2625 transitions. [2021-12-19 17:48:27,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:48:27,311 INFO L681 BuchiCegarLoop]: Abstraction has 2244 states and 2625 transitions. [2021-12-19 17:48:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states and 2625 transitions. [2021-12-19 17:48:27,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 1811. [2021-12-19 17:48:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1728 states have (on average 1.1516203703703705) internal successors, (1990), 1728 states have internal predecessors, (1990), 52 states have call successors, (54), 34 states have call predecessors, (54), 31 states have return successors, (99), 48 states have call predecessors, (99), 48 states have call successors, (99) [2021-12-19 17:48:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2143 transitions. [2021-12-19 17:48:27,328 INFO L704 BuchiCegarLoop]: Abstraction has 1811 states and 2143 transitions. [2021-12-19 17:48:27,328 INFO L587 BuchiCegarLoop]: Abstraction has 1811 states and 2143 transitions. [2021-12-19 17:48:27,328 INFO L425 BuchiCegarLoop]: ======== Iteration 29============ [2021-12-19 17:48:27,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1811 states and 2143 transitions. [2021-12-19 17:48:27,332 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 116 [2021-12-19 17:48:27,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:48:27,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:48:27,332 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:48:27,333 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:48:27,333 INFO L791 eck$LassoCheckResult]: Stem: 95996#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 95973#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; 95974#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; 95976#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; 95977#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 95978#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; 95979#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 95980#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; 96032#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 96031#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; 96030#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 96029#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; 96028#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 96027#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; 96026#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 96025#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 95956#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 96105#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 96104#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); 96098#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 96103#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 96101#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); 96095#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 96099#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 96102#L24 assume ~n#1 < 2; 96100#merge_sortFINAL assume true; 96094#merge_sortEXIT >#87#return; 96079#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 96110#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 96111#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); 96093#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 96096#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 96112#L24 assume ~n#1 < 2; 96113#merge_sortFINAL assume true; 96092#merge_sortEXIT >#87#return; 96086#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 96133#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 96134#L24 assume ~n#1 < 2; 96085#merge_sortFINAL assume true; 96087#merge_sortEXIT >#89#return; 96132#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; 96131#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 96129#L12 assume !(merge_~j~0#1 == merge_~n#1); 96128#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); 96125#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; 96126#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 96230#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 96218#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; 96214#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 96209#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 96206#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; 96203#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; 96200#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 96195#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 96194#L11-4 merge_~i~0#1 := 0; 96193#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; 96192#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 96191#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; 96190#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 96189#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 96188#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 96187#L8 assume { :end_inline_merge } true; 96186#merge_sortFINAL assume true; 96183#merge_sortEXIT >#89#return; 96184#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; 96407#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 96402#L12 assume !(merge_~j~0#1 == merge_~n#1); 96399#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); 96395#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; 96391#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 96388#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 96385#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; 96381#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 96378#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 96373#L12 assume !(merge_~j~0#1 == merge_~n#1); 96370#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); 96367#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; 96364#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 96362#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 96347#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; 96344#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 96334#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 96328#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; 96325#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; 96320#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 96313#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 96312#L11-4 merge_~i~0#1 := 0; 96309#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; 96307#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 96305#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; 96303#L17-2 [2021-12-19 17:48:27,333 INFO L793 eck$LassoCheckResult]: Loop: 96303#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 96302#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; 96303#L17-2 [2021-12-19 17:48:27,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash -37535414, now seen corresponding path program 12 times [2021-12-19 17:48:27,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:27,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657108772] [2021-12-19 17:48:27,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:27,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:27,384 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:48:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:27,421 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:48:27,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:27,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 10 times [2021-12-19 17:48:27,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:27,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010302368] [2021-12-19 17:48:27,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:27,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:27,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:48:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:27,426 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:48:27,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:48:27,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1711792824, now seen corresponding path program 13 times [2021-12-19 17:48:27,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:48:27,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639111998] [2021-12-19 17:48:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:48:27,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:48:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:27,464 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:48:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:48:27,503 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:48:40,537 WARN L227 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 407 DAG size of output: 328 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:48:47,748 WARN L227 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 179 DAG size of output: 168 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:49:03,108 WARN L227 SmtUtils]: Spent 7.02s on a formula simplification. DAG size of input: 188 DAG size of output: 187 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:49:30,846 WARN L227 SmtUtils]: Spent 13.51s on a formula simplification. DAG size of input: 244 DAG size of output: 234 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:49:37,950 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:49:37,950 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:49:37,950 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:49:37,950 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:49:37,950 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:49:37,950 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:37,950 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:49:37,950 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:49:37,950 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration29_Lasso [2021-12-19 17:49:37,950 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:49:37,950 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:49:37,950 WARN L322 ript$VariableManager]: TermVariabe |aux_mod_v_ULTIMATE.start_main_~n~0#1_58_41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-19 17:49:37,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:37,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:45,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:49:46,238 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:49:46,238 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:49:46,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,240 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2021-12-19 17:49:46,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2021-12-19 17:49:46,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,282 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2021-12-19 17:49:46,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:46,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,308 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2021-12-19 17:49:46,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2021-12-19 17:49:46,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,333 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2021-12-19 17:49:46,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2021-12-19 17:49:46,358 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,359 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2021-12-19 17:49:46,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:46,392 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,393 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2021-12-19 17:49:46,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2021-12-19 17:49:46,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,422 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2021-12-19 17:49:46,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 [2021-12-19 17:49:46,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2021-12-19 17:49:46,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,447 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2021-12-19 17:49:46,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2021-12-19 17:49:46,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,473 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2021-12-19 17:49:46,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:46,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,497 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2021-12-19 17:49:46,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2021-12-19 17:49:46,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,527 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2021-12-19 17:49:46,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2021-12-19 17:49:46,566 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,567 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2021-12-19 17:49:46,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2021-12-19 17:49:46,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,593 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2021-12-19 17:49:46,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:49:46,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:49:46,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:46,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,622 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2021-12-19 17:49:46,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:46,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,647 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2021-12-19 17:49:46,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2021-12-19 17:49:46,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,672 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2021-12-19 17:49:46,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2021-12-19 17:49:46,696 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,697 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2021-12-19 17:49:46,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 [2021-12-19 17:49:46,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2021-12-19 17:49:46,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,722 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2021-12-19 17:49:46,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:46,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,765 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2021-12-19 17:49:46,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2021-12-19 17:49:46,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,796 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2021-12-19 17:49:46,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:49:46,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:49:46,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2021-12-19 17:49:46,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,853 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2021-12-19 17:49:46,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2021-12-19 17:49:46,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,879 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2021-12-19 17:49:46,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:49:46,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:49:46,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2021-12-19 17:49:46,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,919 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2021-12-19 17:49:46,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,927 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2021-12-19 17:49:46,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,935 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2021-12-19 17:49:46,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:49:46,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2021-12-19 17:49:46,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,964 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2021-12-19 17:49:46,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:49:46,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:49:46,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:46,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2021-12-19 17:49:46,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:46,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:46,991 INFO L229 MonitoredProcess]: Starting monitored process 209 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:46,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2021-12-19 17:49:46,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:46,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:46,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:46,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:46,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:46,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:46,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:46,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:46,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:47,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:47,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:47,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:47,015 INFO L229 MonitoredProcess]: Starting monitored process 210 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:47,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2021-12-19 17:49:47,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:47,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:47,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:47,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:47,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:47,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:47,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:47,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:47,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:47,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:47,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:47,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:47,039 INFO L229 MonitoredProcess]: Starting monitored process 211 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:47,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2021-12-19 17:49:47,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:47,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:47,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:47,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:47,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:47,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:49:47,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:49:47,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:47,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2021-12-19 17:49:47,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:47,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:47,066 INFO L229 MonitoredProcess]: Starting monitored process 212 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:47,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2021-12-19 17:49:47,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:47,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:47,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:47,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:47,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:47,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:49:47,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:49:47,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:47,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:47,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:47,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:47,093 INFO L229 MonitoredProcess]: Starting monitored process 213 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:47,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2021-12-19 17:49:47,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:47,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:47,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:47,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:47,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:47,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:49:47,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:49:47,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:47,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2021-12-19 17:49:47,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:47,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:47,122 INFO L229 MonitoredProcess]: Starting monitored process 214 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:47,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2021-12-19 17:49:47,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:47,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:47,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:47,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:47,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:47,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:49:47,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:49:47,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:47,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:47,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:47,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:47,161 INFO L229 MonitoredProcess]: Starting monitored process 215 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:47,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2021-12-19 17:49:47,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:47,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:47,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:47,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:47,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:47,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:49:47,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:49:47,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:47,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:47,186 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:47,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:47,187 INFO L229 MonitoredProcess]: Starting monitored process 216 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:47,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2021-12-19 17:49:47,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:47,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:47,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:49:47,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:47,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:47,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:47,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:49:47,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:49:47,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:49:47,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:47,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:47,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:47,211 INFO L229 MonitoredProcess]: Starting monitored process 217 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:47,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2021-12-19 17:49:47,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:49:47,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:49:47,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:49:47,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:49:47,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:49:47,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:49:47,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:49:47,263 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:49:47,380 INFO L443 ModelExtractionUtils]: Simplification made 66 calls to the SMT solver. [2021-12-19 17:49:47,380 INFO L444 ModelExtractionUtils]: 10 out of 64 variables were initially zero. Simplification set additionally 48 variables to zero. [2021-12-19 17:49:47,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:49:47,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:49:47,382 INFO L229 MonitoredProcess]: Starting monitored process 218 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:49:47,396 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:49:47,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2021-12-19 17:49:47,413 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-19 17:49:47,413 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:49:47,413 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~a#1.offset, merge_sort_merge_~i~0#1, merge_sort_merge_#in~n#1) = -1*merge_sort_#in~a#1.offset - 4*merge_sort_merge_~i~0#1 + 8*merge_sort_merge_#in~n#1 Supporting invariants [-1*v_rep(select #length merge_sort_merge_~x~0#1.base)_6 + 4*merge_sort_merge_#in~n#1 >= 0] [2021-12-19 17:49:47,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:47,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Forceful destruction successful, exit code 0 [2021-12-19 17:49:47,850 INFO L297 tatePredicateManager]: 101 out of 104 supporting invariants were superfluous and have been removed [2021-12-19 17:49:47,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:49:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:49:47,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 83 conjunts are in the unsatisfiable core [2021-12-19 17:49:47,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:49:48,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:49:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:49:49,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 17:49:49,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:49:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:49:49,635 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.29 stem predicates 2 loop predicates [2021-12-19 17:49:49,635 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1811 states and 2143 transitions. cyclomatic complexity: 387 Second operand has 31 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-19 17:49:52,460 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1811 states and 2143 transitions. cyclomatic complexity: 387. Second operand has 31 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Result 2465 states and 2874 transitions. Complement of second has 65 states. [2021-12-19 17:49:52,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 42 states 38 stem states 1 non-accepting loop states 2 accepting loop states [2021-12-19 17:49:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-19 17:49:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 148 transitions. [2021-12-19 17:49:52,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 148 transitions. Stem has 90 letters. Loop has 2 letters. [2021-12-19 17:49:52,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:49:52,463 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:49:52,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:49:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:49:52,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-19 17:49:52,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:49:53,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:49:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:49:53,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 17:49:53,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:49:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:49:53,778 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.17 stem predicates 2 loop predicates [2021-12-19 17:49:53,778 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1811 states and 2143 transitions. cyclomatic complexity: 387 Second operand has 19 states, 16 states have (on average 3.75) internal successors, (60), 14 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-19 17:49:54,793 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1811 states and 2143 transitions. cyclomatic complexity: 387. Second operand has 19 states, 16 states have (on average 3.75) internal successors, (60), 14 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Result 1875 states and 2212 transitions. Complement of second has 32 states. [2021-12-19 17:49:54,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 19 stem states 1 non-accepting loop states 2 accepting loop states [2021-12-19 17:49:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 3.75) internal successors, (60), 14 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-19 17:49:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2021-12-19 17:49:54,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 84 transitions. Stem has 90 letters. Loop has 2 letters. [2021-12-19 17:49:54,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:49:54,794 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:49:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:49:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:49:54,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 83 conjunts are in the unsatisfiable core [2021-12-19 17:49:54,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:49:55,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:49:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:49:56,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 17:49:56,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:49:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:49:56,556 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.29 stem predicates 2 loop predicates [2021-12-19 17:49:56,556 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1811 states and 2143 transitions. cyclomatic complexity: 387 Second operand has 31 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-19 17:50:00,858 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1811 states and 2143 transitions. cyclomatic complexity: 387. Second operand has 31 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Result 2865 states and 3339 transitions. Complement of second has 92 states. [2021-12-19 17:50:00,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 49 states 45 stem states 1 non-accepting loop states 2 accepting loop states [2021-12-19 17:50:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-19 17:50:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 303 transitions. [2021-12-19 17:50:00,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 303 transitions. Stem has 90 letters. Loop has 2 letters. [2021-12-19 17:50:00,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:00,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 303 transitions. Stem has 92 letters. Loop has 2 letters. [2021-12-19 17:50:00,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:00,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 303 transitions. Stem has 90 letters. Loop has 4 letters. [2021-12-19 17:50:00,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:00,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2865 states and 3339 transitions. [2021-12-19 17:50:00,868 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 156 [2021-12-19 17:50:00,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2865 states to 2345 states and 2752 transitions. [2021-12-19 17:50:00,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1762 [2021-12-19 17:50:00,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1809 [2021-12-19 17:50:00,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2345 states and 2752 transitions. [2021-12-19 17:50:00,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:50:00,875 INFO L681 BuchiCegarLoop]: Abstraction has 2345 states and 2752 transitions. [2021-12-19 17:50:00,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states and 2752 transitions. [2021-12-19 17:50:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1991. [2021-12-19 17:50:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1991 states, 1901 states have (on average 1.1478169384534456) internal successors, (2182), 1901 states have internal predecessors, (2182), 55 states have call successors, (58), 36 states have call predecessors, (58), 35 states have return successors, (102), 53 states have call predecessors, (102), 51 states have call successors, (102) [2021-12-19 17:50:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2342 transitions. [2021-12-19 17:50:00,892 INFO L704 BuchiCegarLoop]: Abstraction has 1991 states and 2342 transitions. [2021-12-19 17:50:00,892 INFO L587 BuchiCegarLoop]: Abstraction has 1991 states and 2342 transitions. [2021-12-19 17:50:00,893 INFO L425 BuchiCegarLoop]: ======== Iteration 30============ [2021-12-19 17:50:00,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1991 states and 2342 transitions. [2021-12-19 17:50:00,896 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 116 [2021-12-19 17:50:00,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:50:00,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:50:00,897 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-19 17:50:00,897 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:50:00,897 INFO L791 eck$LassoCheckResult]: Stem: 106740#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 106714#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; 106715#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; 106717#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; 106718#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 106719#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; 106720#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 106721#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; 106779#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 106778#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; 106777#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 106776#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 106694#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 106788#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 106789#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); 106783#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 106782#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 106784#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); 107334#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 107351#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 107338#L24 assume ~n#1 < 2; 107333#merge_sortFINAL assume true; 107335#merge_sortEXIT >#87#return; 107445#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 107446#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 107457#L24 assume ~n#1 < 2; 107451#merge_sortFINAL assume true; 107444#merge_sortEXIT >#89#return; 107441#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; 107437#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 107434#L12 assume !(merge_~j~0#1 == merge_~n#1); 107431#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); 107428#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; 107425#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 107421#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 107419#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; 107417#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 107414#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 107415#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; 107418#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; 107416#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 107413#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 107407#L11-4 merge_~i~0#1 := 0; 107406#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; 107405#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 107404#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; 107402#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 107352#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 107339#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 107336#L8 assume { :end_inline_merge } true; 107331#merge_sortFINAL assume true; 107318#merge_sortEXIT >#87#return; 106735#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 106785#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 106780#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); 106734#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 106736#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 107453#L24 assume ~n#1 < 2; 107452#merge_sortFINAL assume true; 107330#merge_sortEXIT >#87#return; 106748#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 106749#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 106753#L24 assume ~n#1 < 2; 106754#merge_sortFINAL assume true; 108210#merge_sortEXIT >#89#return; 108209#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; 108207#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 108204#L12 assume !(merge_~j~0#1 == merge_~n#1); 108202#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); 108199#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; 108196#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 108192#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 108190#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; 108188#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 108185#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 108186#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; 108189#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; 108187#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 108184#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 108178#L11-4 merge_~i~0#1 := 0; 108177#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; 108176#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 108175#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; 108174#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 108170#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 108171#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 108420#L8 assume { :end_inline_merge } true; 108396#merge_sortFINAL assume true; 108238#merge_sortEXIT >#89#return; 106726#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; 106727#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 108683#L12 assume !(merge_~j~0#1 == merge_~n#1); 106704#L13 [2021-12-19 17:50:00,897 INFO L793 eck$LassoCheckResult]: Loop: 106704#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); 106705#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 106693#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 106695#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 108672#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; 106756#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 106757#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 108659#L12 assume !(merge_~j~0#1 == merge_~n#1); 106704#L13 [2021-12-19 17:50:00,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:00,898 INFO L85 PathProgramCache]: Analyzing trace with hash -160946933, now seen corresponding path program 14 times [2021-12-19 17:50:00,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:00,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933956663] [2021-12-19 17:50:00,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:00,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:00,929 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:00,962 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash 617079631, now seen corresponding path program 3 times [2021-12-19 17:50:00,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:00,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286652648] [2021-12-19 17:50:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:00,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:00,967 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:00,971 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:00,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash -504930727, now seen corresponding path program 3 times [2021-12-19 17:50:00,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:00,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849820910] [2021-12-19 17:50:00,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:00,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:01,005 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:01,064 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:13,678 WARN L227 SmtUtils]: Spent 7.52s on a formula simplification. DAG size of input: 276 DAG size of output: 255 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:50:30,570 WARN L227 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 223 DAG size of output: 214 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:50:35,482 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:50:35,482 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:50:35,482 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:50:35,482 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:50:35,482 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:50:35,482 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:35,482 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:50:35,482 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:50:35,482 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration30_Lasso [2021-12-19 17:50:35,482 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:50:35,482 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:50:35,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:35,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:35,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:35,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:35,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:35,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:35,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:38,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:40,005 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:50:40,006 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:50:40,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,007 INFO L229 MonitoredProcess]: Starting monitored process 219 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2021-12-19 17:50:40,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:40,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:40,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:40,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:40,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,055 INFO L229 MonitoredProcess]: Starting monitored process 220 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2021-12-19 17:50:40,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:40,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:40,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:40,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Ended with exit code 0 [2021-12-19 17:50:40,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,111 INFO L229 MonitoredProcess]: Starting monitored process 221 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2021-12-19 17:50:40,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:40,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:40,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:40,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Ended with exit code 0 [2021-12-19 17:50:40,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,151 INFO L229 MonitoredProcess]: Starting monitored process 222 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2021-12-19 17:50:40,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:40,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:40,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:40,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Ended with exit code 0 [2021-12-19 17:50:40,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,175 INFO L229 MonitoredProcess]: Starting monitored process 223 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2021-12-19 17:50:40,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:40,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:40,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:40,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:40,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,199 INFO L229 MonitoredProcess]: Starting monitored process 224 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2021-12-19 17:50:40,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:40,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:40,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:40,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:40,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,223 INFO L229 MonitoredProcess]: Starting monitored process 225 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2021-12-19 17:50:40,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:40,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:40,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Ended with exit code 0 [2021-12-19 17:50:40,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,252 INFO L229 MonitoredProcess]: Starting monitored process 226 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2021-12-19 17:50:40,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:40,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:40,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Ended with exit code 0 [2021-12-19 17:50:40,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,279 INFO L229 MonitoredProcess]: Starting monitored process 227 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2021-12-19 17:50:40,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:40,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:40,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:40,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,319 INFO L229 MonitoredProcess]: Starting monitored process 228 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Waiting until timeout for monitored process [2021-12-19 17:50:40,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:40,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:40,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Ended with exit code 0 [2021-12-19 17:50:40,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,362 INFO L229 MonitoredProcess]: Starting monitored process 229 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Waiting until timeout for monitored process [2021-12-19 17:50:40,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:40,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:40,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:40,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:40,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,385 INFO L229 MonitoredProcess]: Starting monitored process 230 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Waiting until timeout for monitored process [2021-12-19 17:50:40,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:40,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:40,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:40,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Ended with exit code 0 [2021-12-19 17:50:40,408 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,409 INFO L229 MonitoredProcess]: Starting monitored process 231 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Waiting until timeout for monitored process [2021-12-19 17:50:40,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:40,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:40,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:40,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Ended with exit code 0 [2021-12-19 17:50:40,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,434 INFO L229 MonitoredProcess]: Starting monitored process 232 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Waiting until timeout for monitored process [2021-12-19 17:50:40,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:40,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:40,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:40,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,477 INFO L229 MonitoredProcess]: Starting monitored process 233 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Waiting until timeout for monitored process [2021-12-19 17:50:40,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:40,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:40,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:40,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,526 INFO L229 MonitoredProcess]: Starting monitored process 234 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Waiting until timeout for monitored process [2021-12-19 17:50:40,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:40,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:40,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:40,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:40,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:40,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:40,568 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:40,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:40,568 INFO L229 MonitoredProcess]: Starting monitored process 235 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:40,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Waiting until timeout for monitored process [2021-12-19 17:50:40,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:50:40,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:40,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:40,577 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2021-12-19 17:50:40,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:40,646 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2021-12-19 17:50:40,646 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2021-12-19 17:50:41,170 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:50:44,297 INFO L443 ModelExtractionUtils]: Simplification made 111 calls to the SMT solver. [2021-12-19 17:50:44,297 INFO L444 ModelExtractionUtils]: 65 out of 190 variables were initially zero. Simplification set additionally 120 variables to zero. [2021-12-19 17:50:44,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:44,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:44,298 INFO L229 MonitoredProcess]: Starting monitored process 236 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:44,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Waiting until timeout for monitored process [2021-12-19 17:50:44,300 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:50:44,308 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2021-12-19 17:50:44,308 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:50:44,308 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~n#1, merge_sort_merge_~i~0#1, merge_sort_merge_~j~0#1, merge_sort_merge_~x~0#1.offset) = 4*merge_sort_merge_~n#1 - 4*merge_sort_merge_~i~0#1 + 4*merge_sort_merge_~j~0#1 + 1*merge_sort_merge_~x~0#1.offset Supporting invariants [] [2021-12-19 17:50:44,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:44,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:44,508 INFO L297 tatePredicateManager]: 47 out of 48 supporting invariants were superfluous and have been removed [2021-12-19 17:50:44,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:44,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-19 17:50:44,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:45,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 17:50:45,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:45,305 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2021-12-19 17:50:45,305 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1991 states and 2342 transitions. cyclomatic complexity: 410 Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:50:45,494 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1991 states and 2342 transitions. cyclomatic complexity: 410. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2162 states and 2515 transitions. Complement of second has 20 states. [2021-12-19 17:50:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 4 non-accepting loop states 2 accepting loop states [2021-12-19 17:50:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:50:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2021-12-19 17:50:45,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 92 letters. Loop has 8 letters. [2021-12-19 17:50:45,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:45,496 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:50:45,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:45,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-19 17:50:45,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:46,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 17:50:46,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:46,449 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 5 loop predicates [2021-12-19 17:50:46,449 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1991 states and 2342 transitions. cyclomatic complexity: 410 Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:50:46,652 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1991 states and 2342 transitions. cyclomatic complexity: 410. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2169 states and 2522 transitions. Complement of second has 20 states. [2021-12-19 17:50:46,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 4 non-accepting loop states 2 accepting loop states [2021-12-19 17:50:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:50:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2021-12-19 17:50:46,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 92 letters. Loop has 8 letters. [2021-12-19 17:50:46,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:46,661 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:50:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:46,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-19 17:50:46,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:47,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 17:50:47,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:47,504 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2021-12-19 17:50:47,504 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1991 states and 2342 transitions. cyclomatic complexity: 410 Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:50:47,708 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1991 states and 2342 transitions. cyclomatic complexity: 410. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2901 states and 3339 transitions. Complement of second has 38 states. [2021-12-19 17:50:47,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 4 non-accepting loop states 2 accepting loop states [2021-12-19 17:50:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:50:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2021-12-19 17:50:47,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 83 transitions. Stem has 92 letters. Loop has 8 letters. [2021-12-19 17:50:47,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:47,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 83 transitions. Stem has 100 letters. Loop has 8 letters. [2021-12-19 17:50:47,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:47,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 83 transitions. Stem has 92 letters. Loop has 16 letters. [2021-12-19 17:50:47,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:47,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2901 states and 3339 transitions. [2021-12-19 17:50:47,725 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 148 [2021-12-19 17:50:47,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2901 states to 2588 states and 3021 transitions. [2021-12-19 17:50:47,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1661 [2021-12-19 17:50:47,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2010 [2021-12-19 17:50:47,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2588 states and 3021 transitions. [2021-12-19 17:50:47,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:50:47,734 INFO L681 BuchiCegarLoop]: Abstraction has 2588 states and 3021 transitions. [2021-12-19 17:50:47,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states and 3021 transitions. [2021-12-19 17:50:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2388. [2021-12-19 17:50:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 2288 states have (on average 1.1503496503496504) internal successors, (2632), 2287 states have internal predecessors, (2632), 62 states have call successors, (65), 39 states have call predecessors, (65), 38 states have return successors, (116), 61 states have call predecessors, (116), 58 states have call successors, (116) [2021-12-19 17:50:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 2813 transitions. [2021-12-19 17:50:47,753 INFO L704 BuchiCegarLoop]: Abstraction has 2388 states and 2813 transitions. [2021-12-19 17:50:47,753 INFO L587 BuchiCegarLoop]: Abstraction has 2388 states and 2813 transitions. [2021-12-19 17:50:47,753 INFO L425 BuchiCegarLoop]: ======== Iteration 31============ [2021-12-19 17:50:47,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2388 states and 2813 transitions. [2021-12-19 17:50:47,758 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 146 [2021-12-19 17:50:47,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:50:47,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:50:47,760 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-19 17:50:47,760 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:50:47,760 INFO L791 eck$LassoCheckResult]: Stem: 117230#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 117209#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; 117210#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; 117212#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; 117213#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 117214#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; 117215#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 117216#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; 117268#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 117267#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; 117266#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 117265#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 117191#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 117523#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117519#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); 117454#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 117458#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117453#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); 117455#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 117467#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117665#L24 assume ~n#1 < 2; 117666#merge_sortFINAL assume true; 117465#merge_sortEXIT >#87#return; 117466#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 117774#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117777#L24 assume ~n#1 < 2; 117775#merge_sortFINAL assume true; 117773#merge_sortEXIT >#89#return; 117772#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; 117770#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 117771#L12 assume !(merge_~j~0#1 == merge_~n#1); 117795#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); 117793#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; 117791#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 117788#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 117787#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; 117785#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 117782#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 117783#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; 117786#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; 117784#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 117781#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 117739#L11-4 merge_~i~0#1 := 0; 117738#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; 117737#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 117736#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; 117735#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 117734#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 117733#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 117732#L8 assume { :end_inline_merge } true; 117731#merge_sortFINAL assume true; 117730#merge_sortEXIT >#87#return; 117241#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 117729#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117776#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); 117473#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 117741#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117742#L24 assume ~n#1 < 2; 117472#merge_sortFINAL assume true; 117474#merge_sortEXIT >#87#return; 117240#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 117242#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117246#L24 assume ~n#1 < 2; 117247#merge_sortFINAL assume true; 119063#merge_sortEXIT >#89#return; 119064#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; 119244#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 119242#L12 assume !(merge_~j~0#1 == merge_~n#1); 119241#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); 119239#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; 119240#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 119253#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 119251#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; 119249#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 119223#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 119224#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; 119227#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; 119226#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 119225#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 119086#L11-4 merge_~i~0#1 := 0; 119084#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; 119082#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 119080#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; 119078#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 119076#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 119075#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 119072#L8 assume { :end_inline_merge } true; 119070#merge_sortFINAL assume true; 119062#merge_sortEXIT >#89#return; 117221#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; 117222#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 117217#L12 assume !(merge_~j~0#1 == merge_~n#1); 117218#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); 117229#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; 117196#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 117195#L13-2 [2021-12-19 17:50:47,760 INFO L793 eck$LassoCheckResult]: Loop: 117195#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 117254#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; 117250#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 117251#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 119535#L12 assume !(merge_~j~0#1 == merge_~n#1); 117198#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); 117199#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 117190#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 117195#L13-2 [2021-12-19 17:50:47,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:47,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1586553742, now seen corresponding path program 15 times [2021-12-19 17:50:47,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:47,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907537961] [2021-12-19 17:50:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:47,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:47,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:47,834 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash 306297587, now seen corresponding path program 4 times [2021-12-19 17:50:47,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:47,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371861530] [2021-12-19 17:50:47,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:47,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:47,839 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:47,842 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:47,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:47,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1022765468, now seen corresponding path program 4 times [2021-12-19 17:50:47,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:47,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495220336] [2021-12-19 17:50:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:47,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:47,890 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:47,922 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:51:01,967 WARN L227 SmtUtils]: Spent 9.07s on a formula simplification. DAG size of input: 330 DAG size of output: 299 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:51:21,215 WARN L227 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 241 DAG size of output: 232 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:51:26,610 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:51:26,610 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:51:26,610 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:51:26,610 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:51:26,610 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:51:26,610 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:51:26,610 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:51:26,610 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:51:26,610 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration31_Lasso [2021-12-19 17:51:26,610 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:51:26,610 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:51:26,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:26,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:26,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:26,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:29,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:51:31,467 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:51:31,468 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:51:31,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:51:31,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:51:31,469 INFO L229 MonitoredProcess]: Starting monitored process 237 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:51:31,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Waiting until timeout for monitored process [2021-12-19 17:51:31,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:51:31,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:51:31,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:51:31,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:51:31,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:51:31,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:51:31,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:51:31,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:51:31,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Forceful destruction successful, exit code 0 [2021-12-19 17:51:31,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:51:31,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:51:31,497 INFO L229 MonitoredProcess]: Starting monitored process 238 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:51:31,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Waiting until timeout for monitored process [2021-12-19 17:51:31,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:51:31,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:51:31,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:51:31,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:51:31,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:51:31,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:51:31,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:51:31,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:51:31,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:51:31,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Ended with exit code 0 [2021-12-19 17:51:31,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:51:31,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:51:31,520 INFO L229 MonitoredProcess]: Starting monitored process 239 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:51:31,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Waiting until timeout for monitored process [2021-12-19 17:51:31,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:51:31,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:51:31,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:51:31,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:51:31,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:51:31,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:51:31,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:51:31,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:51:31,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:51:31,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Forceful destruction successful, exit code 0 [2021-12-19 17:51:31,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:51:31,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:51:31,544 INFO L229 MonitoredProcess]: Starting monitored process 240 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:51:31,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Waiting until timeout for monitored process [2021-12-19 17:51:31,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:51:31,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:51:31,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:51:31,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:51:31,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:51:31,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:51:31,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:51:31,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:51:31,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:51:31,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Ended with exit code 0 [2021-12-19 17:51:31,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:51:31,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:51:31,568 INFO L229 MonitoredProcess]: Starting monitored process 241 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:51:31,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Waiting until timeout for monitored process [2021-12-19 17:51:31,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:51:31,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:51:31,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:51:31,576 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2021-12-19 17:51:31,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:51:31,655 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2021-12-19 17:51:31,656 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2021-12-19 17:51:32,358 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:51:34,426 INFO L443 ModelExtractionUtils]: Simplification made 44 calls to the SMT solver. [2021-12-19 17:51:34,426 INFO L444 ModelExtractionUtils]: 90 out of 226 variables were initially zero. Simplification set additionally 133 variables to zero. [2021-12-19 17:51:34,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:51:34,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:51:34,427 INFO L229 MonitoredProcess]: Starting monitored process 242 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:51:34,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Waiting until timeout for monitored process [2021-12-19 17:51:34,429 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:51:34,438 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2021-12-19 17:51:34,438 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:51:34,438 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~n#1, merge_sort_merge_~k~0#1) = 1*merge_sort_merge_~n#1 - 1*merge_sort_merge_~k~0#1 Supporting invariants [] [2021-12-19 17:51:34,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Forceful destruction successful, exit code 0 [2021-12-19 17:51:34,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Forceful destruction successful, exit code 0 [2021-12-19 17:51:34,593 INFO L297 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2021-12-19 17:51:34,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:51:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:34,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 17:51:34,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:51:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:35,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:51:35,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:51:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:51:35,240 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 [2021-12-19 17:51:35,240 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2388 states and 2813 transitions. cyclomatic complexity: 499 Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:51:35,292 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2388 states and 2813 transitions. cyclomatic complexity: 499. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2712 states and 3186 transitions. Complement of second has 9 states. [2021-12-19 17:51:35,292 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 [2021-12-19 17:51:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:51:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2021-12-19 17:51:35,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 95 letters. Loop has 8 letters. [2021-12-19 17:51:35,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:51:35,294 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:51:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:51:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:35,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 17:51:35,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:51:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:35,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:51:35,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:51:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:51:35,929 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2021-12-19 17:51:35,930 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2388 states and 2813 transitions. cyclomatic complexity: 499 Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:51:35,982 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2388 states and 2813 transitions. cyclomatic complexity: 499. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2792 states and 3266 transitions. Complement of second has 11 states. [2021-12-19 17:51:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-19 17:51:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:51:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2021-12-19 17:51:35,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 95 letters. Loop has 8 letters. [2021-12-19 17:51:35,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:51:35,985 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:51:35,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:51:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:36,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 17:51:36,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:51:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:36,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:51:36,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:51:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:51:36,625 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2021-12-19 17:51:36,625 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2388 states and 2813 transitions. cyclomatic complexity: 499 Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:51:36,712 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2388 states and 2813 transitions. cyclomatic complexity: 499. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 4137 states and 4873 transitions. Complement of second has 17 states. [2021-12-19 17:51:36,713 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 [2021-12-19 17:51:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:51:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2021-12-19 17:51:36,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 95 letters. Loop has 8 letters. [2021-12-19 17:51:36,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:51:36,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 103 letters. Loop has 8 letters. [2021-12-19 17:51:36,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:51:36,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 95 letters. Loop has 16 letters. [2021-12-19 17:51:36,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:51:36,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4137 states and 4873 transitions. [2021-12-19 17:51:36,725 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 38 [2021-12-19 17:51:36,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4137 states to 2549 states and 3014 transitions. [2021-12-19 17:51:36,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 962 [2021-12-19 17:51:36,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1787 [2021-12-19 17:51:36,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2549 states and 3014 transitions. [2021-12-19 17:51:36,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:51:36,753 INFO L681 BuchiCegarLoop]: Abstraction has 2549 states and 3014 transitions. [2021-12-19 17:51:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states and 3014 transitions. [2021-12-19 17:51:36,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 1890. [2021-12-19 17:51:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1807 states have (on average 1.1654676258992807) internal successors, (2106), 1804 states have internal predecessors, (2106), 55 states have call successors, (58), 32 states have call predecessors, (58), 28 states have return successors, (103), 53 states have call predecessors, (103), 48 states have call successors, (103) [2021-12-19 17:51:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2267 transitions. [2021-12-19 17:51:36,770 INFO L704 BuchiCegarLoop]: Abstraction has 1890 states and 2267 transitions. [2021-12-19 17:51:36,770 INFO L587 BuchiCegarLoop]: Abstraction has 1890 states and 2267 transitions. [2021-12-19 17:51:36,770 INFO L425 BuchiCegarLoop]: ======== Iteration 32============ [2021-12-19 17:51:36,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1890 states and 2267 transitions. [2021-12-19 17:51:36,773 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2021-12-19 17:51:36,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:51:36,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:51:36,774 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:51:36,774 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:51:36,774 INFO L791 eck$LassoCheckResult]: Stem: 130414#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 130388#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; 130389#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; 130392#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; 130393#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 130394#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; 130395#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 130396#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; 130453#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 130452#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; 130451#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 130450#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; 130449#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 130448#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; 130447#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 130445#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; 130444#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 130443#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 130410#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 130441#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 130442#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); 130386#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 130385#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 130387#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); 130422#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 130605#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 130430#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); 130423#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 130605#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 130607#L24 assume ~n#1 < 2; 130606#merge_sortFINAL assume true; 130604#merge_sortEXIT >#87#return; 130383#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 130593#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 130592#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); 130586#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 130587#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 130590#L24 assume ~n#1 < 2; 130589#merge_sortFINAL assume true; 130584#merge_sortEXIT >#87#return; 130580#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 130582#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 130588#L24 assume ~n#1 < 2; 130583#merge_sortFINAL assume true; 130578#merge_sortEXIT >#89#return; 130581#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; 131386#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 131384#L12 assume !(merge_~j~0#1 == merge_~n#1); 131383#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); 131381#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; 131380#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 131379#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 131375#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; 131376#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 131371#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 131372#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; 130650#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; 130648#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 130649#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 130644#L11-4 merge_~i~0#1 := 0; 130645#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; 130886#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 130885#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; 130884#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 130883#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 130882#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 130881#L8 assume { :end_inline_merge } true; 130880#merge_sortFINAL assume true; 130878#merge_sortEXIT >#89#return; 130879#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; 131283#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 131281#L12 assume !(merge_~j~0#1 == merge_~n#1); 131279#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); 131280#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 131326#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 131324#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 131322#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; 131320#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 131318#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 131314#L12 assume !(merge_~j~0#1 == merge_~n#1); 131309#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; 131306#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 131302#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; 131298#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 131294#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 131290#L12 assume !(merge_~j~0#1 == merge_~n#1); 131285#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; 131261#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 131258#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; 131257#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 131256#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 131255#L11-4 merge_~i~0#1 := 0; 131254#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; 131253#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 131252#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; 131251#L17-2 [2021-12-19 17:51:36,775 INFO L793 eck$LassoCheckResult]: Loop: 131251#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 131250#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; 131251#L17-2 [2021-12-19 17:51:36,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:51:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash 823821855, now seen corresponding path program 3 times [2021-12-19 17:51:36,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:51:36,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640255264] [2021-12-19 17:51:36,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:51:36,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:51:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:36,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-19 17:51:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:36,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-19 17:51:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:36,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-19 17:51:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:36,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:51:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 57 proven. 77 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-19 17:51:36,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:51:36,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640255264] [2021-12-19 17:51:36,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640255264] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:51:36,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559110882] [2021-12-19 17:51:36,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 17:51:36,944 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:51:36,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:51:36,945 INFO L229 MonitoredProcess]: Starting monitored process 243 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:51:36,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (243)] Waiting until timeout for monitored process [2021-12-19 17:51:37,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-12-19 17:51:37,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:51:37,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-19 17:51:37,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:51:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 68 proven. 87 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-19 17:51:37,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:51:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 70 proven. 85 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-19 17:51:38,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559110882] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:51:38,101 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:51:38,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 24] total 44 [2021-12-19 17:51:38,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120039680] [2021-12-19 17:51:38,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:51:38,101 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:51:38,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:51:38,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 11 times [2021-12-19 17:51:38,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:51:38,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44640738] [2021-12-19 17:51:38,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:51:38,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:51:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:51:38,105 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:51:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:51:38,107 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:51:38,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:51:38,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-19 17:51:38,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1665, Unknown=0, NotChecked=0, Total=1892 [2021-12-19 17:51:38,153 INFO L87 Difference]: Start difference. First operand 1890 states and 2267 transitions. cyclomatic complexity: 436 Second operand has 44 states, 38 states have (on average 3.0) internal successors, (114), 37 states have internal predecessors, (114), 10 states have call successors, (16), 8 states have call predecessors, (16), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-19 17:51:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:51:39,584 INFO L93 Difference]: Finished difference Result 3272 states and 3776 transitions. [2021-12-19 17:51:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-12-19 17:51:39,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3272 states and 3776 transitions. [2021-12-19 17:51:39,604 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 40 [2021-12-19 17:51:39,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3272 states to 3265 states and 3769 transitions. [2021-12-19 17:51:39,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2486 [2021-12-19 17:51:39,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2500 [2021-12-19 17:51:39,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3265 states and 3769 transitions. [2021-12-19 17:51:39,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:51:39,615 INFO L681 BuchiCegarLoop]: Abstraction has 3265 states and 3769 transitions. [2021-12-19 17:51:39,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states and 3769 transitions. [2021-12-19 17:51:39,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 2502. [2021-12-19 17:51:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2502 states, 2398 states have (on average 1.1618015012510425) internal successors, (2786), 2398 states have internal predecessors, (2786), 67 states have call successors, (73), 38 states have call predecessors, (73), 37 states have return successors, (122), 65 states have call predecessors, (122), 58 states have call successors, (122) [2021-12-19 17:51:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 2981 transitions. [2021-12-19 17:51:39,653 INFO L704 BuchiCegarLoop]: Abstraction has 2502 states and 2981 transitions. [2021-12-19 17:51:39,653 INFO L587 BuchiCegarLoop]: Abstraction has 2502 states and 2981 transitions. [2021-12-19 17:51:39,654 INFO L425 BuchiCegarLoop]: ======== Iteration 33============ [2021-12-19 17:51:39,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2502 states and 2981 transitions. [2021-12-19 17:51:39,659 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 40 [2021-12-19 17:51:39,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:51:39,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:51:39,660 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 12, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:51:39,660 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:51:39,660 INFO L791 eck$LassoCheckResult]: Stem: 136359#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 136330#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; 136331#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; 136334#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; 136335#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 136336#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; 136337#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 136338#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; 136409#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 136408#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; 136407#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 136406#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; 136405#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 136404#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; 136403#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 136401#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; 136400#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 136398#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; 136397#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 136396#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; 136395#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 136394#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; 136393#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 136392#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; 136391#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 136389#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; 136388#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 136387#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 136357#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 136385#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 136386#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); 136324#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 136323#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 136325#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); 136377#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 136588#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 136590#L24 assume ~n#1 < 2; 136589#merge_sortFINAL assume true; 136585#merge_sortEXIT >#87#return; 136320#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 136574#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 136572#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); 136565#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 136567#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 136570#L24 assume ~n#1 < 2; 136568#merge_sortFINAL assume true; 136564#merge_sortEXIT >#87#return; 136557#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 136559#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 136569#L24 assume ~n#1 < 2; 136562#merge_sortFINAL assume true; 136555#merge_sortEXIT >#89#return; 136558#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; 137227#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 137225#L12 assume !(merge_~j~0#1 == merge_~n#1); 137221#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); 137222#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; 137228#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 138675#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 138674#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; 138673#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 138672#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 138671#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; 137135#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; 137131#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 136908#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 136907#L11-4 merge_~i~0#1 := 0; 136906#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; 136905#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 136904#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; 136903#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 136902#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 136901#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 136900#L8 assume { :end_inline_merge } true; 136899#merge_sortFINAL assume true; 136895#merge_sortEXIT >#89#return; 136894#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; 136893#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 136891#L12 assume !(merge_~j~0#1 == merge_~n#1); 136889#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); 136890#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 136933#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 136932#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 136931#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; 136930#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 136929#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 136927#L12 assume !(merge_~j~0#1 == merge_~n#1); 136925#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; 136923#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 136921#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; 136919#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 136917#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 136915#L12 assume !(merge_~j~0#1 == merge_~n#1); 136910#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; 136871#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 136866#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; 136863#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 136857#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 136854#L11-4 merge_~i~0#1 := 0; 136851#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; 136848#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 136845#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; 136840#L17-2 [2021-12-19 17:51:39,661 INFO L793 eck$LassoCheckResult]: Loop: 136840#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 136839#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; 136840#L17-2 [2021-12-19 17:51:39,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:51:39,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1218593559, now seen corresponding path program 4 times [2021-12-19 17:51:39,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:51:39,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504615856] [2021-12-19 17:51:39,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:51:39,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:51:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:39,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-19 17:51:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:39,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-19 17:51:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:39,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-19 17:51:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:39,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:51:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:51:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 148 proven. 72 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-19 17:51:39,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:51:39,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504615856] [2021-12-19 17:51:39,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504615856] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:51:39,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800331985] [2021-12-19 17:51:39,941 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 17:51:39,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:51:39,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:51:39,942 INFO L229 MonitoredProcess]: Starting monitored process 244 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:51:39,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (244)] Waiting until timeout for monitored process [2021-12-19 17:51:40,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 17:51:40,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:51:40,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-19 17:51:40,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:51:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 174 proven. 53 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-19 17:51:40,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:51:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 174 proven. 55 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-19 17:51:40,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800331985] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:51:40,874 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:51:40,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 26] total 45 [2021-12-19 17:51:40,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556859761] [2021-12-19 17:51:40,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:51:40,874 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:51:40,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:51:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 12 times [2021-12-19 17:51:40,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:51:40,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797945354] [2021-12-19 17:51:40,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:51:40,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:51:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:51:40,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:51:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:51:40,880 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:51:40,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:51:40,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-19 17:51:40,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1713, Unknown=0, NotChecked=0, Total=1980 [2021-12-19 17:51:40,934 INFO L87 Difference]: Start difference. First operand 2502 states and 2981 transitions. cyclomatic complexity: 550 Second operand has 45 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 35 states have internal predecessors, (98), 13 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2021-12-19 17:51:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:51:42,278 INFO L93 Difference]: Finished difference Result 4552 states and 5573 transitions. [2021-12-19 17:51:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-19 17:51:42,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4552 states and 5573 transitions. [2021-12-19 17:51:42,308 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 91 [2021-12-19 17:51:42,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4552 states to 4534 states and 5547 transitions. [2021-12-19 17:51:42,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2297 [2021-12-19 17:51:42,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2297 [2021-12-19 17:51:42,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4534 states and 5547 transitions. [2021-12-19 17:51:42,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:51:42,320 INFO L681 BuchiCegarLoop]: Abstraction has 4534 states and 5547 transitions. [2021-12-19 17:51:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states and 5547 transitions. [2021-12-19 17:51:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2731. [2021-12-19 17:51:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2731 states, 2611 states have (on average 1.1750287246265798) internal successors, (3068), 2612 states have internal predecessors, (3068), 82 states have call successors, (86), 41 states have call predecessors, (86), 38 states have return successors, (158), 77 states have call predecessors, (158), 71 states have call successors, (158) [2021-12-19 17:51:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 3312 transitions. [2021-12-19 17:51:42,349 INFO L704 BuchiCegarLoop]: Abstraction has 2731 states and 3312 transitions. [2021-12-19 17:51:42,350 INFO L587 BuchiCegarLoop]: Abstraction has 2731 states and 3312 transitions. [2021-12-19 17:51:42,350 INFO L425 BuchiCegarLoop]: ======== Iteration 34============ [2021-12-19 17:51:42,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2731 states and 3312 transitions. [2021-12-19 17:51:42,355 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 53 [2021-12-19 17:51:42,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:51:42,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:51:42,356 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:51:42,356 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:51:42,356 INFO L791 eck$LassoCheckResult]: Stem: 144173#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 144149#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; 144150#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; 144152#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; 144153#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 144154#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; 144155#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 144156#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; 144223#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 144222#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; 144221#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 144220#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; 144219#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 144218#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; 144217#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 144215#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; 144214#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 144212#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 144213#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 144421#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 144418#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); 144414#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 144672#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 144413#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); 144404#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 144407#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 144411#L24 assume ~n#1 < 2; 144408#merge_sortFINAL assume true; 144403#merge_sortEXIT >#87#return; 144384#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 144394#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 144393#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); 144386#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 144388#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 144391#L24 assume ~n#1 < 2; 144390#merge_sortFINAL assume true; 144385#merge_sortEXIT >#87#return; 144377#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 144380#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 144389#L24 assume ~n#1 < 2; 144381#merge_sortFINAL assume true; 144376#merge_sortEXIT >#89#return; 144379#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; 144489#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144487#L12 assume !(merge_~j~0#1 == merge_~n#1); 144486#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); 144484#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; 144485#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 144908#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 144906#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; 144904#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144901#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144894#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; 144892#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; 144890#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144888#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 144886#L11-4 merge_~i~0#1 := 0; 144884#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; 144883#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 144881#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; 144879#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 144878#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 144877#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 144875#L8 assume { :end_inline_merge } true; 144873#merge_sortFINAL assume true; 144867#merge_sortEXIT >#89#return; 144865#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; 144862#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144859#L12 assume !(merge_~j~0#1 == merge_~n#1); 144856#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); 144853#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; 144851#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 144849#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 144847#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; 144845#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144843#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144842#L12 assume !(merge_~j~0#1 == merge_~n#1); 144840#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); 144837#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; 144838#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 144839#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 144822#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; 144819#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144816#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144813#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; 144812#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; 144811#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144810#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 144809#L11-4 merge_~i~0#1 := 0; 144808#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; 144807#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 144806#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; 144805#L17-2 [2021-12-19 17:51:42,356 INFO L793 eck$LassoCheckResult]: Loop: 144805#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 144804#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; 144805#L17-2 [2021-12-19 17:51:42,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:51:42,357 INFO L85 PathProgramCache]: Analyzing trace with hash 488944040, now seen corresponding path program 16 times [2021-12-19 17:51:42,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:51:42,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836843337] [2021-12-19 17:51:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:51:42,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:51:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:51:42,397 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:51:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:51:42,440 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:51:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:51:42,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 13 times [2021-12-19 17:51:42,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:51:42,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240995887] [2021-12-19 17:51:42,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:51:42,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:51:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:51:42,445 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:51:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:51:42,467 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:51:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:51:42,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1723788838, now seen corresponding path program 17 times [2021-12-19 17:51:42,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:51:42,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627167934] [2021-12-19 17:51:42,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:51:42,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:51:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:51:42,504 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:51:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:51:42,549 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:51:54,584 WARN L227 SmtUtils]: Spent 9.43s on a formula simplification. DAG size of input: 403 DAG size of output: 317 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:52:32,874 WARN L227 SmtUtils]: Spent 14.92s on a formula simplification. DAG size of input: 230 DAG size of output: 220 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:52:36,562 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:52:36,562 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:52:36,562 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:52:36,562 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:52:36,562 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:52:36,562 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:36,563 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:52:36,563 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:52:36,563 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration34_Lasso [2021-12-19 17:52:36,563 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:52:36,563 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:52:36,563 WARN L322 ript$VariableManager]: TermVariabe |aux_mod_v_merge_sort_#in~n#1_451_34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-19 17:52:36,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:36,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:40,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:40,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:40,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:40,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:40,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:52:41,800 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:52:41,800 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:52:41,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:41,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:41,802 INFO L229 MonitoredProcess]: Starting monitored process 245 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:41,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Waiting until timeout for monitored process [2021-12-19 17:52:41,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:41,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:41,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:41,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:41,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:41,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:41,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:41,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:41,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:41,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:41,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:41,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:41,844 INFO L229 MonitoredProcess]: Starting monitored process 246 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:41,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:41,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:41,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:41,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:41,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:41,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:52:41,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:52:41,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Waiting until timeout for monitored process [2021-12-19 17:52:41,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:41,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:41,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:41,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:41,891 INFO L229 MonitoredProcess]: Starting monitored process 247 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:41,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Waiting until timeout for monitored process [2021-12-19 17:52:41,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:41,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:41,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:41,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:41,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:41,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:41,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:41,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:41,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:41,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:41,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:41,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:41,935 INFO L229 MonitoredProcess]: Starting monitored process 248 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:41,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Waiting until timeout for monitored process [2021-12-19 17:52:41,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:41,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:41,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:41,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:41,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:41,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:41,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:41,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:41,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:41,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Ended with exit code 0 [2021-12-19 17:52:41,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:41,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:41,962 INFO L229 MonitoredProcess]: Starting monitored process 249 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:41,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Waiting until timeout for monitored process [2021-12-19 17:52:41,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:41,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:41,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:41,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:41,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:41,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:41,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:41,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:41,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:41,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Ended with exit code 0 [2021-12-19 17:52:41,984 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:41,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:41,985 INFO L229 MonitoredProcess]: Starting monitored process 250 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:41,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Waiting until timeout for monitored process [2021-12-19 17:52:41,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 [2021-12-19 17:52:41,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:41,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:41,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:41,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:41,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:41,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:41,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:41,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Ended with exit code 0 [2021-12-19 17:52:42,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,008 INFO L229 MonitoredProcess]: Starting monitored process 251 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Waiting until timeout for monitored process [2021-12-19 17:52:42,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Ended with exit code 0 [2021-12-19 17:52:42,029 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,030 INFO L229 MonitoredProcess]: Starting monitored process 252 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Waiting until timeout for monitored process [2021-12-19 17:52:42,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Ended with exit code 0 [2021-12-19 17:52:42,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,052 INFO L229 MonitoredProcess]: Starting monitored process 253 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Waiting until timeout for monitored process [2021-12-19 17:52:42,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Ended with exit code 0 [2021-12-19 17:52:42,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,076 INFO L229 MonitoredProcess]: Starting monitored process 254 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Waiting until timeout for monitored process [2021-12-19 17:52:42,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Ended with exit code 0 [2021-12-19 17:52:42,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,107 INFO L229 MonitoredProcess]: Starting monitored process 255 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Waiting until timeout for monitored process [2021-12-19 17:52:42,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Ended with exit code 0 [2021-12-19 17:52:42,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,130 INFO L229 MonitoredProcess]: Starting monitored process 256 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Waiting until timeout for monitored process [2021-12-19 17:52:42,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Ended with exit code 0 [2021-12-19 17:52:42,152 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,153 INFO L229 MonitoredProcess]: Starting monitored process 257 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Waiting until timeout for monitored process [2021-12-19 17:52:42,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Ended with exit code 0 [2021-12-19 17:52:42,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,175 INFO L229 MonitoredProcess]: Starting monitored process 258 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Waiting until timeout for monitored process [2021-12-19 17:52:42,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:42,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,215 INFO L229 MonitoredProcess]: Starting monitored process 259 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Waiting until timeout for monitored process [2021-12-19 17:52:42,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:42,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,255 INFO L229 MonitoredProcess]: Starting monitored process 260 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Waiting until timeout for monitored process [2021-12-19 17:52:42,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:42,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,292 INFO L229 MonitoredProcess]: Starting monitored process 261 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Waiting until timeout for monitored process [2021-12-19 17:52:42,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:52:42,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:52:42,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:42,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,336 INFO L229 MonitoredProcess]: Starting monitored process 262 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Waiting until timeout for monitored process [2021-12-19 17:52:42,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:42,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,382 INFO L229 MonitoredProcess]: Starting monitored process 263 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Waiting until timeout for monitored process [2021-12-19 17:52:42,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:42,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,420 INFO L229 MonitoredProcess]: Starting monitored process 264 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Waiting until timeout for monitored process [2021-12-19 17:52:42,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Ended with exit code 0 [2021-12-19 17:52:42,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,467 INFO L229 MonitoredProcess]: Starting monitored process 265 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Waiting until timeout for monitored process [2021-12-19 17:52:42,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:42,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,492 INFO L229 MonitoredProcess]: Starting monitored process 266 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Waiting until timeout for monitored process [2021-12-19 17:52:42,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Ended with exit code 0 [2021-12-19 17:52:42,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,515 INFO L229 MonitoredProcess]: Starting monitored process 267 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Waiting until timeout for monitored process [2021-12-19 17:52:42,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Ended with exit code 0 [2021-12-19 17:52:42,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,538 INFO L229 MonitoredProcess]: Starting monitored process 268 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Waiting until timeout for monitored process [2021-12-19 17:52:42,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:42,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,561 INFO L229 MonitoredProcess]: Starting monitored process 269 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Waiting until timeout for monitored process [2021-12-19 17:52:42,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Ended with exit code 0 [2021-12-19 17:52:42,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,583 INFO L229 MonitoredProcess]: Starting monitored process 270 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Waiting until timeout for monitored process [2021-12-19 17:52:42,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:42,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,606 INFO L229 MonitoredProcess]: Starting monitored process 271 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Waiting until timeout for monitored process [2021-12-19 17:52:42,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Ended with exit code 0 [2021-12-19 17:52:42,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,628 INFO L229 MonitoredProcess]: Starting monitored process 272 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Waiting until timeout for monitored process [2021-12-19 17:52:42,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:42,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,650 INFO L229 MonitoredProcess]: Starting monitored process 273 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Waiting until timeout for monitored process [2021-12-19 17:52:42,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:52:42,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:52:42,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Ended with exit code 0 [2021-12-19 17:52:42,678 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,679 INFO L229 MonitoredProcess]: Starting monitored process 274 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Waiting until timeout for monitored process [2021-12-19 17:52:42,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 [2021-12-19 17:52:42,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:52:42,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:52:42,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Ended with exit code 0 [2021-12-19 17:52:42,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,710 INFO L229 MonitoredProcess]: Starting monitored process 275 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Waiting until timeout for monitored process [2021-12-19 17:52:42,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Ended with exit code 0 [2021-12-19 17:52:42,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,734 INFO L229 MonitoredProcess]: Starting monitored process 276 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Waiting until timeout for monitored process [2021-12-19 17:52:42,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:52:42,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:52:42,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:42,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,759 INFO L229 MonitoredProcess]: Starting monitored process 277 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Waiting until timeout for monitored process [2021-12-19 17:52:42,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:52:42,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:52:42,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Ended with exit code 0 [2021-12-19 17:52:42,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,810 INFO L229 MonitoredProcess]: Starting monitored process 278 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Waiting until timeout for monitored process [2021-12-19 17:52:42,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:52:42,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:52:42,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Ended with exit code 0 [2021-12-19 17:52:42,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,834 INFO L229 MonitoredProcess]: Starting monitored process 279 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Waiting until timeout for monitored process [2021-12-19 17:52:42,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Ended with exit code 0 [2021-12-19 17:52:42,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,857 INFO L229 MonitoredProcess]: Starting monitored process 280 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Waiting until timeout for monitored process [2021-12-19 17:52:42,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Ended with exit code 0 [2021-12-19 17:52:42,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,881 INFO L229 MonitoredProcess]: Starting monitored process 281 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Waiting until timeout for monitored process [2021-12-19 17:52:42,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:52:42,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:52:42,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Ended with exit code 0 [2021-12-19 17:52:42,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,906 INFO L229 MonitoredProcess]: Starting monitored process 282 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Waiting until timeout for monitored process [2021-12-19 17:52:42,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:52:42,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:52:42,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:52:42,914 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:42,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,929 INFO L229 MonitoredProcess]: Starting monitored process 283 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Waiting until timeout for monitored process [2021-12-19 17:52:42,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:42,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:52:42,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:52:42,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Ended with exit code 0 [2021-12-19 17:52:42,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,954 INFO L229 MonitoredProcess]: Starting monitored process 284 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Waiting until timeout for monitored process [2021-12-19 17:52:42,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:42,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:42,961 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2021-12-19 17:52:42,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:42,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:42,968 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2021-12-19 17:52:42,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:52:42,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:42,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:42,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:42,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:42,996 INFO L229 MonitoredProcess]: Starting monitored process 285 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:42,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Waiting until timeout for monitored process [2021-12-19 17:52:42,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:43,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:43,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:43,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:43,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:43,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:52:43,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:52:43,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:43,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:43,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:43,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:43,024 INFO L229 MonitoredProcess]: Starting monitored process 286 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:43,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Waiting until timeout for monitored process [2021-12-19 17:52:43,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 [2021-12-19 17:52:43,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:43,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:43,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:43,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:43,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:52:43,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:52:43,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:52:43,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Ended with exit code 0 [2021-12-19 17:52:43,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:43,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:43,052 INFO L229 MonitoredProcess]: Starting monitored process 287 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:43,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Waiting until timeout for monitored process [2021-12-19 17:52:43,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:52:43,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:52:43,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:52:43,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:52:43,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:52:43,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:52:43,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:52:43,085 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:52:43,124 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2021-12-19 17:52:43,124 INFO L444 ModelExtractionUtils]: 21 out of 64 variables were initially zero. Simplification set additionally 40 variables to zero. [2021-12-19 17:52:43,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:52:43,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:43,125 INFO L229 MonitoredProcess]: Starting monitored process 288 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:52:43,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Waiting until timeout for monitored process [2021-12-19 17:52:43,127 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:52:43,132 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 17:52:43,132 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:52:43,133 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1, v_rep(select #length merge_sort_#in~a#1.base)_11) = -2*merge_sort_merge_~i~0#1 + 1*v_rep(select #length merge_sort_#in~a#1.base)_11 Supporting invariants [] [2021-12-19 17:52:43,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:43,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Forceful destruction successful, exit code 0 [2021-12-19 17:52:43,469 INFO L297 tatePredicateManager]: 94 out of 97 supporting invariants were superfluous and have been removed [2021-12-19 17:52:43,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:52:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:43,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-19 17:52:43,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:52:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:44,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 17:52:44,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:52:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:52:44,147 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2021-12-19 17:52:44,147 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2731 states and 3312 transitions. cyclomatic complexity: 679 Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:52:44,325 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2731 states and 3312 transitions. cyclomatic complexity: 679. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2774 states and 3360 transitions. Complement of second has 14 states. [2021-12-19 17:52:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2021-12-19 17:52:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:52:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2021-12-19 17:52:44,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 92 letters. Loop has 2 letters. [2021-12-19 17:52:44,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:52:44,327 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:52:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:52:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:44,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-19 17:52:44,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:52:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:44,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 17:52:44,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:52:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:52:44,979 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2021-12-19 17:52:44,979 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2731 states and 3312 transitions. cyclomatic complexity: 679 Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:52:45,150 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2731 states and 3312 transitions. cyclomatic complexity: 679. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2774 states and 3360 transitions. Complement of second has 14 states. [2021-12-19 17:52:45,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2021-12-19 17:52:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:52:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2021-12-19 17:52:45,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 92 letters. Loop has 2 letters. [2021-12-19 17:52:45,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:52:45,152 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:52:45,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:52:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:45,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-19 17:52:45,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:52:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:45,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 17:52:45,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:52:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:52:45,821 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2021-12-19 17:52:45,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2731 states and 3312 transitions. cyclomatic complexity: 679 Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:52:45,988 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2731 states and 3312 transitions. cyclomatic complexity: 679. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2816 states and 3404 transitions. Complement of second has 14 states. [2021-12-19 17:52:45,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2021-12-19 17:52:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:52:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2021-12-19 17:52:45,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 92 letters. Loop has 2 letters. [2021-12-19 17:52:45,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:52:45,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 94 letters. Loop has 2 letters. [2021-12-19 17:52:45,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:52:45,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 92 letters. Loop has 4 letters. [2021-12-19 17:52:45,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:52:45,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2816 states and 3404 transitions. [2021-12-19 17:52:45,998 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 39 [2021-12-19 17:52:46,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2816 states to 2748 states and 3330 transitions. [2021-12-19 17:52:46,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1718 [2021-12-19 17:52:46,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1758 [2021-12-19 17:52:46,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2748 states and 3330 transitions. [2021-12-19 17:52:46,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:52:46,005 INFO L681 BuchiCegarLoop]: Abstraction has 2748 states and 3330 transitions. [2021-12-19 17:52:46,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states and 3330 transitions. [2021-12-19 17:52:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2709. [2021-12-19 17:52:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2709 states, 2589 states have (on average 1.1757435303205872) internal successors, (3044), 2590 states have internal predecessors, (3044), 82 states have call successors, (86), 41 states have call predecessors, (86), 38 states have return successors, (158), 77 states have call predecessors, (158), 71 states have call successors, (158) [2021-12-19 17:52:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2709 states and 3288 transitions. [2021-12-19 17:52:46,029 INFO L704 BuchiCegarLoop]: Abstraction has 2709 states and 3288 transitions. [2021-12-19 17:52:46,029 INFO L587 BuchiCegarLoop]: Abstraction has 2709 states and 3288 transitions. [2021-12-19 17:52:46,029 INFO L425 BuchiCegarLoop]: ======== Iteration 35============ [2021-12-19 17:52:46,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2709 states and 3288 transitions. [2021-12-19 17:52:46,034 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 39 [2021-12-19 17:52:46,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:52:46,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:52:46,035 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:52:46,035 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:52:46,035 INFO L791 eck$LassoCheckResult]: Stem: 156625#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 156604#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; 156605#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; 156607#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; 156608#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 156609#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; 156610#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 156611#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; 156676#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 156675#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; 156674#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 156673#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; 156672#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 156671#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 156646#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 156647#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 156851#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); 156826#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 156849#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 156847#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); 156837#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 156838#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 156846#L24 assume ~n#1 < 2; 156845#merge_sortFINAL assume true; 156836#merge_sortEXIT >#87#return; 156831#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 156833#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 156840#L24 assume ~n#1 < 2; 156835#merge_sortFINAL assume true; 156830#merge_sortEXIT >#89#return; 156825#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; 156827#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 157190#L12 assume !(merge_~j~0#1 == merge_~n#1); 157186#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); 157181#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; 157176#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 157173#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 157169#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; 157165#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 157164#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 157155#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; 157104#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; 157084#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 157083#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 157082#L11-4 merge_~i~0#1 := 0; 157081#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; 157002#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 156992#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; 156991#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 156982#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 156978#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 156976#L8 assume { :end_inline_merge } true; 156974#merge_sortFINAL assume true; 156969#merge_sortEXIT >#87#return; 156630#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 156968#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 156967#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); 156638#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 156920#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 156637#L24 assume ~n#1 < 2; 156641#merge_sortFINAL assume true; 156928#merge_sortEXIT >#87#return; 156582#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 156962#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 156951#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); 156640#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 156920#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 156637#L24 assume ~n#1 < 2; 156641#merge_sortFINAL assume true; 156928#merge_sortEXIT >#87#return; 156639#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 156920#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 156637#L24 assume ~n#1 < 2; 156641#merge_sortFINAL assume true; 156928#merge_sortEXIT >#89#return; 156615#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; 156616#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 156612#L12 assume !(merge_~j~0#1 == merge_~n#1); 156593#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); 156594#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; 156581#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 156583#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 156648#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; 156643#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 156626#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 156627#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; 159029#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; 159028#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 159027#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 159026#L11-4 merge_~i~0#1 := 0; 159025#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; 159022#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 159020#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; 159017#L17-2 [2021-12-19 17:52:46,035 INFO L793 eck$LassoCheckResult]: Loop: 159017#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 159018#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; 159017#L17-2 [2021-12-19 17:52:46,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:52:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2139945010, now seen corresponding path program 18 times [2021-12-19 17:52:46,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:52:46,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607796119] [2021-12-19 17:52:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:52:46,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:52:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:52:46,079 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:52:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:52:46,103 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:52:46,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:52:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 14 times [2021-12-19 17:52:46,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:52:46,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472902360] [2021-12-19 17:52:46,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:52:46,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:52:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:52:46,108 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:52:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:52:46,111 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:52:46,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:52:46,111 INFO L85 PathProgramCache]: Analyzing trace with hash 802181836, now seen corresponding path program 19 times [2021-12-19 17:52:46,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:52:46,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672223594] [2021-12-19 17:52:46,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:52:46,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:52:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-19 17:52:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:46,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-19 17:52:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:52:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:46,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-19 17:52:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-19 17:52:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:46,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-19 17:52:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 22 proven. 122 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-19 17:52:46,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:52:46,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672223594] [2021-12-19 17:52:46,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672223594] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:52:46,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196671122] [2021-12-19 17:52:46,531 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-19 17:52:46,532 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:52:46,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:52:46,533 INFO L229 MonitoredProcess]: Starting monitored process 289 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:52:46,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (289)] Waiting until timeout for monitored process [2021-12-19 17:52:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:52:46,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 17:52:46,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:52:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-12-19 17:52:46,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 17:52:46,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196671122] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:52:46,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-19 17:52:46,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [28] total 34 [2021-12-19 17:52:46,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956448114] [2021-12-19 17:52:46,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:52:47,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:52:47,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-19 17:52:47,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1071, Unknown=0, NotChecked=0, Total=1190 [2021-12-19 17:52:47,030 INFO L87 Difference]: Start difference. First operand 2709 states and 3288 transitions. cyclomatic complexity: 675 Second operand has 10 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:52:47,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:52:47,227 INFO L93 Difference]: Finished difference Result 2827 states and 3406 transitions. [2021-12-19 17:52:47,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-19 17:52:47,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2827 states and 3406 transitions. [2021-12-19 17:52:47,238 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2021-12-19 17:52:47,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2827 states to 2821 states and 3397 transitions. [2021-12-19 17:52:47,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1849 [2021-12-19 17:52:47,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1872 [2021-12-19 17:52:47,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2821 states and 3397 transitions. [2021-12-19 17:52:47,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:52:47,250 INFO L681 BuchiCegarLoop]: Abstraction has 2821 states and 3397 transitions. [2021-12-19 17:52:47,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states and 3397 transitions. [2021-12-19 17:52:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 2710. [2021-12-19 17:52:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2591 states have (on average 1.1721343110768043) internal successors, (3037), 2592 states have internal predecessors, (3037), 81 states have call successors, (85), 41 states have call predecessors, (85), 38 states have return successors, (155), 76 states have call predecessors, (155), 71 states have call successors, (155) [2021-12-19 17:52:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3277 transitions. [2021-12-19 17:52:47,279 INFO L704 BuchiCegarLoop]: Abstraction has 2710 states and 3277 transitions. [2021-12-19 17:52:47,279 INFO L587 BuchiCegarLoop]: Abstraction has 2710 states and 3277 transitions. [2021-12-19 17:52:47,279 INFO L425 BuchiCegarLoop]: ======== Iteration 36============ [2021-12-19 17:52:47,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2710 states and 3277 transitions. [2021-12-19 17:52:47,285 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 33 [2021-12-19 17:52:47,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:52:47,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:52:47,286 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 7, 7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-19 17:52:47,286 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 17:52:47,287 INFO L791 eck$LassoCheckResult]: Stem: 162556#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 162531#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; 162532#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; 162534#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; 162535#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 162536#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; 162537#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 162538#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; 162607#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 162606#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; 162605#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 162604#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; 162603#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 162602#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 162548#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 162579#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164923#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); 162511#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 162549#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164944#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); 164920#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164921#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164939#L24 assume ~n#1 < 2; 164937#merge_sortFINAL assume true; 164934#merge_sortEXIT >#87#return; 162545#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164922#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 162570#L24 assume ~n#1 < 2; 162571#merge_sortFINAL assume true; 162544#merge_sortEXIT >#89#return; 162546#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; 165141#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165142#L12 assume !(merge_~j~0#1 == merge_~n#1); 165216#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); 165215#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; 165213#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 165212#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 165209#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; 165210#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165190#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165191#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; 165102#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; 164966#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164962#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 164959#L11-4 merge_~i~0#1 := 0; 162568#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; 162569#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164940#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; 164938#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164936#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 164935#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 164933#L8 assume { :end_inline_merge } true; 164932#merge_sortFINAL assume true; 164928#merge_sortEXIT >#87#return; 162522#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 162521#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 162523#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); 164925#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164930#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 165003#L24 assume ~n#1 < 2; 164931#merge_sortFINAL assume true; 164924#merge_sortEXIT >#87#return; 162519#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 165015#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 163554#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); 163555#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164930#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 165003#L24 assume ~n#1 < 2; 164931#merge_sortFINAL assume true; 164924#merge_sortEXIT >#87#return; 164926#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164930#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 165003#L24 assume ~n#1 < 2; 164931#merge_sortFINAL assume true; 164924#merge_sortEXIT >#89#return; 164927#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; 165024#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164993#L12 assume !(merge_~j~0#1 == merge_~n#1); 164991#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); 164988#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; 164989#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 165219#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 165218#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; 165217#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165113#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165114#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; 164963#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; 164960#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164957#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 164955#L11-4 merge_~i~0#1 := 0; 164954#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; 164953#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164952#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; 164950#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164948#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 162518#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 162520#L8 assume { :end_inline_merge } true; 162533#merge_sortFINAL assume true; 162547#merge_sortEXIT >#89#return; 163911#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; 165074#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165072#L12 assume !(merge_~j~0#1 == merge_~n#1); 165071#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); 165069#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; 165067#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 165066#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 165065#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; 165064#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165063#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165062#L12 assume !(merge_~j~0#1 == merge_~n#1); 165061#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); 165059#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; 165057#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 165056#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 165055#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; 165054#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165053#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165050#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; 165046#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; 165036#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165033#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 162578#L11-4 merge_~i~0#1 := 0; 162561#L17-3 [2021-12-19 17:52:47,287 INFO L793 eck$LassoCheckResult]: Loop: 162561#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; 162560#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 162561#L17-3 [2021-12-19 17:52:47,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:52:47,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2096241015, now seen corresponding path program 20 times [2021-12-19 17:52:47,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:52:47,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891960847] [2021-12-19 17:52:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:52:47,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:52:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:52:47,330 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:52:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:52:47,390 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:52:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:52:47,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 15 times [2021-12-19 17:52:47,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:52:47,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424369913] [2021-12-19 17:52:47,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:52:47,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:52:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:52:47,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:52:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:52:47,398 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:52:47,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:52:47,398 INFO L85 PathProgramCache]: Analyzing trace with hash 147955193, now seen corresponding path program 21 times [2021-12-19 17:52:47,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:52:47,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921922936] [2021-12-19 17:52:47,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:52:47,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:52:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:52:47,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:52:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:52:47,528 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:53:00,833 WARN L227 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 362 DAG size of output: 291 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:53:26,650 WARN L227 SmtUtils]: Spent 15.49s on a formula simplification. DAG size of input: 238 DAG size of output: 229 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:53:35,240 WARN L227 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 223 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:53:42,348 WARN L227 SmtUtils]: Spent 6.64s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:53:50,196 WARN L227 SmtUtils]: Spent 6.27s on a formula simplification that was a NOOP. DAG size: 222 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:54:10,193 WARN L227 SmtUtils]: Spent 20.00s on a formula simplification. DAG size of input: 281 DAG size of output: 273 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:54:36,128 WARN L227 SmtUtils]: Spent 23.51s on a formula simplification. DAG size of input: 243 DAG size of output: 241 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:54:36,131 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:54:36,131 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:54:36,131 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:54:36,131 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:54:36,132 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:54:36,132 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:36,132 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:54:36,132 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:54:36,132 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration36_Lasso [2021-12-19 17:54:36,132 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:54:36,132 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:54:36,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:36,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:36,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:36,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:36,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:36,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:36,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:36,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:36,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:36,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:36,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:36,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:36,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:49,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:54:50,973 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:54:50,973 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:54:50,973 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:50,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:50,975 INFO L229 MonitoredProcess]: Starting monitored process 290 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:50,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Waiting until timeout for monitored process [2021-12-19 17:54:50,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:50,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:50,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:54:50,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:50,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:50,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:50,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:54:50,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:54:50,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Ended with exit code 0 [2021-12-19 17:54:51,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,002 INFO L229 MonitoredProcess]: Starting monitored process 291 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Waiting until timeout for monitored process [2021-12-19 17:54:51,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:54:51,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:54:51,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:54:51,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Forceful destruction successful, exit code 0 [2021-12-19 17:54:51,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,026 INFO L229 MonitoredProcess]: Starting monitored process 292 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Waiting until timeout for monitored process [2021-12-19 17:54:51,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:54:51,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:54:51,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:54:51,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Forceful destruction successful, exit code 0 [2021-12-19 17:54:51,049 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,050 INFO L229 MonitoredProcess]: Starting monitored process 293 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Waiting until timeout for monitored process [2021-12-19 17:54:51,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:54:51,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:54:51,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Ended with exit code 0 [2021-12-19 17:54:51,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,075 INFO L229 MonitoredProcess]: Starting monitored process 294 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Waiting until timeout for monitored process [2021-12-19 17:54:51,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:54:51,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:54:51,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:54:51,082 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Ended with exit code 0 [2021-12-19 17:54:51,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,098 INFO L229 MonitoredProcess]: Starting monitored process 295 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Waiting until timeout for monitored process [2021-12-19 17:54:51,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:54:51,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:54:51,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:54:51,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Forceful destruction successful, exit code 0 [2021-12-19 17:54:51,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,121 INFO L229 MonitoredProcess]: Starting monitored process 296 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Waiting until timeout for monitored process [2021-12-19 17:54:51,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:54:51,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:54:51,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Forceful destruction successful, exit code 0 [2021-12-19 17:54:51,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,147 INFO L229 MonitoredProcess]: Starting monitored process 297 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Waiting until timeout for monitored process [2021-12-19 17:54:51,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:54:51,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:54:51,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:54:51,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Ended with exit code 0 [2021-12-19 17:54:51,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,171 INFO L229 MonitoredProcess]: Starting monitored process 298 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Waiting until timeout for monitored process [2021-12-19 17:54:51,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:54:51,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:54:51,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:54:51,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Forceful destruction successful, exit code 0 [2021-12-19 17:54:51,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,194 INFO L229 MonitoredProcess]: Starting monitored process 299 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Waiting until timeout for monitored process [2021-12-19 17:54:51,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:54:51,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:54:51,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:54:51,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Forceful destruction successful, exit code 0 [2021-12-19 17:54:51,232 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,232 INFO L229 MonitoredProcess]: Starting monitored process 300 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Waiting until timeout for monitored process [2021-12-19 17:54:51,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:54:51,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:54:51,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:54:51,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Ended with exit code 0 [2021-12-19 17:54:51,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,255 INFO L229 MonitoredProcess]: Starting monitored process 301 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Waiting until timeout for monitored process [2021-12-19 17:54:51,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:54:51,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:54:51,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:54:51,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Ended with exit code 0 [2021-12-19 17:54:51,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,278 INFO L229 MonitoredProcess]: Starting monitored process 302 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Waiting until timeout for monitored process [2021-12-19 17:54:51,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:54:51,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:54:51,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Ended with exit code 0 [2021-12-19 17:54:51,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,304 INFO L229 MonitoredProcess]: Starting monitored process 303 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (303)] Waiting until timeout for monitored process [2021-12-19 17:54:51,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:54:51,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:54:51,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:54:51,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (303)] Ended with exit code 0 [2021-12-19 17:54:51,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,328 INFO L229 MonitoredProcess]: Starting monitored process 304 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Waiting until timeout for monitored process [2021-12-19 17:54:51,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:54:51,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:54:51,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:54:51,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Ended with exit code 0 [2021-12-19 17:54:51,358 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,359 INFO L229 MonitoredProcess]: Starting monitored process 305 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Waiting until timeout for monitored process [2021-12-19 17:54:51,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:54:51,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:54:51,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:54:51,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:54:51,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:54:51,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:54:51,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:54:51,400 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:54:51,492 INFO L443 ModelExtractionUtils]: Simplification made 50 calls to the SMT solver. [2021-12-19 17:54:51,492 INFO L444 ModelExtractionUtils]: 7 out of 64 variables were initially zero. Simplification set additionally 52 variables to zero. [2021-12-19 17:54:51,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:54:51,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:54:51,493 INFO L229 MonitoredProcess]: Starting monitored process 306 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:54:51,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Waiting until timeout for monitored process [2021-12-19 17:54:51,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:54:51,500 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-19 17:54:51,500 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:54:51,500 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_#in~a#1.offset, merge_sort_merge_~i~0#1) = 5*merge_sort_merge_#in~a#1.offset - 4*merge_sort_merge_~i~0#1 Supporting invariants [5*merge_sort_merge_#in~a#1.offset - 2*v_rep(select #length merge_sort_#in~a#1.base)_12 >= 0] [2021-12-19 17:54:51,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Forceful destruction successful, exit code 0 [2021-12-19 17:54:52,233 INFO L297 tatePredicateManager]: 92 out of 95 supporting invariants were superfluous and have been removed [2021-12-19 17:54:52,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:54:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:54:52,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 207 conjunts are in the unsatisfiable core [2021-12-19 17:54:52,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:54:52,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:54:52,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:54:52,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Forceful destruction successful, exit code 0 [2021-12-19 17:54:53,605 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-19 17:54:53,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-19 17:54:53,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 17:54:53,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-19 17:54:53,727 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:54:53,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:54:54,735 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-19 17:54:54,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-19 17:54:54,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 17:54:54,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-19 17:54:54,871 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:54:54,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:54:54,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 17:54:54,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-19 17:54:54,966 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:54:54,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:54:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:54:55,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 17:54:55,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:54:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:54:55,651 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.34 stem predicates 2 loop predicates [2021-12-19 17:54:55,651 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2710 states and 3277 transitions. cyclomatic complexity: 654 Second operand has 36 states, 32 states have (on average 2.875) internal successors, (92), 30 states have internal predecessors, (92), 7 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-19 17:54:56,828 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2710 states and 3277 transitions. cyclomatic complexity: 654. Second operand has 36 states, 32 states have (on average 2.875) internal successors, (92), 30 states have internal predecessors, (92), 7 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Result 2710 states and 3277 transitions. Complement of second has 42 states. [2021-12-19 17:54:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 21 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 17:54:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 2.875) internal successors, (92), 30 states have internal predecessors, (92), 7 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-19 17:54:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2021-12-19 17:54:56,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 65 transitions. Stem has 122 letters. Loop has 2 letters. [2021-12-19 17:54:56,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:54:56,830 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:54:56,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:54:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:54:56,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 189 conjunts are in the unsatisfiable core [2021-12-19 17:54:56,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:54:56,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:54:56,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:54:58,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 17:54:58,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-19 17:54:58,180 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:54:58,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:54:59,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:54:59,370 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-19 17:54:59,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2021-12-19 17:54:59,502 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-19 17:54:59,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2021-12-19 17:54:59,527 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-19 17:54:59,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-19 17:54:59,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2021-12-19 17:55:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:55:00,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 17:55:00,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:55:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:55:00,789 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.36 stem predicates 2 loop predicates [2021-12-19 17:55:00,789 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2710 states and 3277 transitions. cyclomatic complexity: 654 Second operand has 38 states, 33 states have (on average 2.757575757575758) internal successors, (91), 30 states have internal predecessors, (91), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-19 17:55:01,820 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2710 states and 3277 transitions. cyclomatic complexity: 654. Second operand has 38 states, 33 states have (on average 2.757575757575758) internal successors, (91), 30 states have internal predecessors, (91), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Result 2710 states and 3277 transitions. Complement of second has 39 states. [2021-12-19 17:55:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 18 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 17:55:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 2.757575757575758) internal successors, (91), 30 states have internal predecessors, (91), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-19 17:55:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 46 transitions. [2021-12-19 17:55:01,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 46 transitions. Stem has 122 letters. Loop has 2 letters. [2021-12-19 17:55:01,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:55:01,822 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:55:01,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:55:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:55:01,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 143 conjunts are in the unsatisfiable core [2021-12-19 17:55:01,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:55:02,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:55:02,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:55:03,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 17:55:03,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-19 17:55:03,079 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:55:03,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:55:03,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:55:03,978 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-19 17:55:03,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-19 17:55:04,128 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-19 17:55:04,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2021-12-19 17:55:04,140 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-19 17:55:04,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-19 17:55:04,740 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:55:04,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-19 17:55:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:55:05,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 17:55:05,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:55:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:55:05,278 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.32 stem predicates 2 loop predicates [2021-12-19 17:55:05,279 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2710 states and 3277 transitions. cyclomatic complexity: 654 Second operand has 34 states, 29 states have (on average 2.896551724137931) internal successors, (84), 26 states have internal predecessors, (84), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-19 17:55:06,608 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2710 states and 3277 transitions. cyclomatic complexity: 654. Second operand has 34 states, 29 states have (on average 2.896551724137931) internal successors, (84), 26 states have internal predecessors, (84), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Result 3228 states and 3890 transitions. Complement of second has 47 states. [2021-12-19 17:55:06,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 21 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 17:55:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 2.896551724137931) internal successors, (84), 26 states have internal predecessors, (84), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-19 17:55:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 83 transitions. [2021-12-19 17:55:06,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 83 transitions. Stem has 122 letters. Loop has 2 letters. [2021-12-19 17:55:06,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:55:06,610 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:55:06,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:55:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:55:06,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 210 conjunts are in the unsatisfiable core [2021-12-19 17:55:06,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:55:06,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:55:06,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:55:07,902 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-19 17:55:07,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-19 17:55:08,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 17:55:08,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-19 17:55:08,031 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:55:08,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:55:08,986 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-19 17:55:08,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-19 17:55:09,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 17:55:09,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-19 17:55:09,131 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:55:09,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:55:09,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 17:55:09,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-19 17:55:09,217 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:55:09,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:55:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:55:09,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 17:55:09,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:55:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:55:09,856 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.35 stem predicates 2 loop predicates [2021-12-19 17:55:09,856 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2710 states and 3277 transitions. cyclomatic complexity: 654 Second operand has 37 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 31 states have internal predecessors, (93), 7 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-19 17:55:11,163 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2710 states and 3277 transitions. cyclomatic complexity: 654. Second operand has 37 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 31 states have internal predecessors, (93), 7 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Result 3228 states and 3890 transitions. Complement of second has 47 states. [2021-12-19 17:55:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 21 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 17:55:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 31 states have internal predecessors, (93), 7 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-19 17:55:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 83 transitions. [2021-12-19 17:55:11,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 83 transitions. Stem has 122 letters. Loop has 2 letters. [2021-12-19 17:55:11,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:55:11,165 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:55:11,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:55:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:55:11,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 205 conjunts are in the unsatisfiable core [2021-12-19 17:55:11,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:55:11,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:55:11,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 17:55:12,478 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-19 17:55:12,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-19 17:55:12,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 17:55:12,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-19 17:55:12,613 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:55:12,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:55:13,576 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-19 17:55:13,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-19 17:55:13,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 17:55:13,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-19 17:55:13,733 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:55:13,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:55:13,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 17:55:13,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-19 17:55:13,822 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:55:13,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:55:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:55:14,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 17:55:14,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:55:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:55:14,478 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.34 stem predicates 2 loop predicates [2021-12-19 17:55:14,479 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 2710 states and 3277 transitions. cyclomatic complexity: 654 Second operand has 36 states, 32 states have (on average 2.875) internal successors, (92), 30 states have internal predecessors, (92), 7 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-19 17:55:16,018 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 2710 states and 3277 transitions. cyclomatic complexity: 654 Second operand has 36 states, 32 states have (on average 2.875) internal successors, (92), 30 states have internal predecessors, (92), 7 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Result 20477 states and 29150 transitions. Complement of second has 195 states 45 powerset states150 rank states. The highest rank that occured is 1 [2021-12-19 17:55:16,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 21 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 17:55:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 2.875) internal successors, (92), 30 states have internal predecessors, (92), 7 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-19 17:55:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 162 transitions. [2021-12-19 17:55:16,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 162 transitions. Stem has 122 letters. Loop has 2 letters. [2021-12-19 17:55:16,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:55:16,022 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:55:16,023 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: no settings was sufficient at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-19 17:55:16,029 INFO L158 Benchmark]: Toolchain (without parser) took 515984.78ms. Allocated memory was 96.5MB in the beginning and 299.9MB in the end (delta: 203.4MB). Free memory was 66.1MB in the beginning and 123.6MB in the end (delta: -57.5MB). Peak memory consumption was 239.2MB. Max. memory is 16.1GB. [2021-12-19 17:55:16,029 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 96.5MB. Free memory was 55.6MB in the beginning and 55.6MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 17:55:16,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.85ms. Allocated memory is still 96.5MB. Free memory was 65.9MB in the beginning and 72.8MB in the end (delta: -6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-19 17:55:16,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.33ms. Allocated memory is still 96.5MB. Free memory was 72.8MB in the beginning and 71.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 17:55:16,029 INFO L158 Benchmark]: Boogie Preprocessor took 34.77ms. Allocated memory is still 96.5MB. Free memory was 71.1MB in the beginning and 69.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 17:55:16,030 INFO L158 Benchmark]: RCFGBuilder took 287.65ms. Allocated memory is still 96.5MB. Free memory was 69.4MB in the beginning and 57.7MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-19 17:55:16,030 INFO L158 Benchmark]: BuchiAutomizer took 515414.90ms. Allocated memory was 96.5MB in the beginning and 299.9MB in the end (delta: 203.4MB). Free memory was 57.7MB in the beginning and 123.6MB in the end (delta: -65.9MB). Peak memory consumption was 233.9MB. Max. memory is 16.1GB. [2021-12-19 17:55:16,031 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.22ms. Allocated memory is still 96.5MB. Free memory was 55.6MB in the beginning and 55.6MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.85ms. Allocated memory is still 96.5MB. Free memory was 65.9MB in the beginning and 72.8MB in the end (delta: -6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.33ms. Allocated memory is still 96.5MB. Free memory was 72.8MB in the beginning and 71.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.77ms. Allocated memory is still 96.5MB. Free memory was 71.1MB in the beginning and 69.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 287.65ms. Allocated memory is still 96.5MB. Free memory was 69.4MB in the beginning and 57.7MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 515414.90ms. Allocated memory was 96.5MB in the beginning and 299.9MB in the end (delta: 203.4MB). Free memory was 57.7MB in the beginning and 123.6MB in the end (delta: -65.9MB). Peak memory consumption was 233.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: no settings was sufficient de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: no settings was sufficient: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-19 17:55:16,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (289)] Forceful destruction successful, exit code 0 [2021-12-19 17:55:16,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (244)] Forceful destruction successful, exit code 0 [2021-12-19 17:55:16,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (243)] Ended with exit code 0 [2021-12-19 17:55:16,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (184)] Forceful destruction successful, exit code 0 [2021-12-19 17:55:16,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (183)] Ended with exit code 0 [2021-12-19 17:55:17,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Ended with exit code 0 [2021-12-19 17:55:17,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (181)] Ended with exit code 0 [2021-12-19 17:55:17,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Ended with exit code 0 [2021-12-19 17:55:17,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Ended with exit code 0 [2021-12-19 17:55:17,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Ended with exit code 0 [2021-12-19 17:55:18,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Ended with exit code 0 [2021-12-19 17:55:18,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Ended with exit code 0 [2021-12-19 17:55:18,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Ended with exit code 0 [2021-12-19 17:55:18,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Ended with exit code 0 [2021-12-19 17:55:18,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2021-12-19 17:55:19,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2021-12-19 17:55:19,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2021-12-19 17:55:19,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2021-12-19 17:55:19,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-19 17:55:19,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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: AssertionError: no settings was sufficient