./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 f4b24e32 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-?-f4b24e3 [2022-07-14 15:06:11,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:06:11,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:06:12,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:06:12,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:06:12,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:06:12,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:06:12,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:06:12,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:06:12,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:06:12,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:06:12,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:06:12,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:06:12,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:06:12,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:06:12,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:06:12,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:06:12,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:06:12,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:06:12,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:06:12,058 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:06:12,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:06:12,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:06:12,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:06:12,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:06:12,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:06:12,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:06:12,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:06:12,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:06:12,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:06:12,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:06:12,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:06:12,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:06:12,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:06:12,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:06:12,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:06:12,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:06:12,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:06:12,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:06:12,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:06:12,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:06:12,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:06:12,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 15:06:12,120 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:06:12,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:06:12,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:06:12,121 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:06:12,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:06:12,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:06:12,123 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:06:12,123 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:06:12,123 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:06:12,124 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:06:12,124 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:06:12,124 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:06:12,125 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:06:12,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:06:12,125 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:06:12,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:06:12,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:06:12,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:06:12,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:06:12,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:06:12,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:06:12,127 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:06:12,127 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:06:12,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:06:12,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:06:12,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:06:12,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:06:12,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:06:12,129 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:06:12,130 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6d71d49c6e185294c0f1f4729e12b8d7df6d1365b5d24a48890a0be5b6780c4 [2022-07-14 15:06:12,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:06:12,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:06:12,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:06:12,363 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:06:12,364 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:06:12,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2022-07-14 15:06:12,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bd25767/18883648e2b24db69c1a886f3e92ce6c/FLAG6d807c25c [2022-07-14 15:06:12,846 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:06:12,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2022-07-14 15:06:12,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bd25767/18883648e2b24db69c1a886f3e92ce6c/FLAG6d807c25c [2022-07-14 15:06:12,869 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bd25767/18883648e2b24db69c1a886f3e92ce6c [2022-07-14 15:06:12,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:06:12,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:06:12,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:06:12,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:06:12,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:06:12,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:06:12" (1/1) ... [2022-07-14 15:06:12,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c5b681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:12, skipping insertion in model container [2022-07-14 15:06:12,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:06:12" (1/1) ... [2022-07-14 15:06:12,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:06:12,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:06:13,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:06:13,046 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:06:13,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:06:13,070 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:06:13,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:13 WrapperNode [2022-07-14 15:06:13,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:06:13,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:06:13,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:06:13,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:06:13,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:13" (1/1) ... [2022-07-14 15:06:13,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:13" (1/1) ... [2022-07-14 15:06:13,099 INFO L137 Inliner]: procedures = 12, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2022-07-14 15:06:13,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:06:13,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:06:13,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:06:13,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:06:13,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:13" (1/1) ... [2022-07-14 15:06:13,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:13" (1/1) ... [2022-07-14 15:06:13,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:13" (1/1) ... [2022-07-14 15:06:13,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:13" (1/1) ... [2022-07-14 15:06:13,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:13" (1/1) ... [2022-07-14 15:06:13,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:13" (1/1) ... [2022-07-14 15:06:13,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:13" (1/1) ... [2022-07-14 15:06:13,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:06:13,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:06:13,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:06:13,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:06:13,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:13" (1/1) ... [2022-07-14 15:06:13,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:13,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:13,151 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:13,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 15:06:13,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:06:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2022-07-14 15:06:13,196 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2022-07-14 15:06:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 15:06:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:06:13,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:06:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:06:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:06:13,259 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:06:13,262 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:06:13,400 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:06:13,405 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:06:13,406 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 15:06:13,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:06:13 BoogieIcfgContainer [2022-07-14 15:06:13,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:06:13,408 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:06:13,409 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:06:13,411 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:06:13,412 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:06:13,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:06:12" (1/3) ... [2022-07-14 15:06:13,413 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d2f4c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:06:13, skipping insertion in model container [2022-07-14 15:06:13,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:06:13,413 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:13" (2/3) ... [2022-07-14 15:06:13,414 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d2f4c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:06:13, skipping insertion in model container [2022-07-14 15:06:13,414 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:06:13,414 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:06:13" (3/3) ... [2022-07-14 15:06:13,415 INFO L354 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2022-07-14 15:06:13,458 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:06:13,459 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:06:13,459 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:06:13,459 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:06:13,459 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:06:13,459 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:06:13,459 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:06:13,460 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:06:13,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 15:06:13,480 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-07-14 15:06:13,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:13,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:13,485 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 15:06:13,485 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:06:13,485 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:06:13,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 15:06:13,489 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-07-14 15:06:13,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:13,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:13,490 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 15:06:13,490 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:06:13,495 INFO L752 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16#L35true assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 10#L40-3true [2022-07-14 15:06:13,496 INFO L754 eck$LassoCheckResult]: Loop: 10#L40-3true assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 11#L40-2true main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 10#L40-3true [2022-07-14 15:06:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:13,501 INFO L85 PathProgramCache]: Analyzing trace with hash 89440, now seen corresponding path program 1 times [2022-07-14 15:06:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:13,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912035938] [2022-07-14 15:06:13,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:13,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:13,646 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:13,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:13,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:13,692 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2022-07-14 15:06:13,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:13,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112624916] [2022-07-14 15:06:13,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:13,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:13,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:13,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:13,748 INFO L85 PathProgramCache]: Analyzing trace with hash 85954242, now seen corresponding path program 1 times [2022-07-14 15:06:13,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:13,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176500381] [2022-07-14 15:06:13,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:13,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:13,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:13,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:14,007 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:06:14,008 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:06:14,008 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:06:14,008 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:06:14,008 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:06:14,009 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:14,009 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:06:14,009 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:06:14,009 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2022-07-14 15:06:14,010 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:06:14,010 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:06:14,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:14,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:14,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:14,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:14,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:14,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:14,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:14,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:14,289 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:06:14,293 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:06:14,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:14,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:14,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:14,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:14,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:14,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:14,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:14,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:14,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:14,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:14,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:14,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 15:06:14,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:14,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-14 15:06:14,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:14,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:14,353 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:14,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 15:06:14,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:14,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:14,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:14,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:14,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:14,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:14,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:14,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:14,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:14,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:14,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:14,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:14,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 15:06:14,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 [2022-07-14 15:06:14,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:14,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:14,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:14,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:14,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:14,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:14,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:14,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:14,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:14,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:14,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:14,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:14,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:14,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:14,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:14,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:14,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:14,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:14,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:14,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 15:06:14,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:14,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:14,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:14,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:14,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:14,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:14,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-14 15:06:14,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:14,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:14,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:14,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:14,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:14,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:14,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:14,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:14,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:14,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:14,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:14,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:14,570 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:14,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-14 15:06:14,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:14,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:14,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:14,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:14,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:14,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:14,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:14,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:14,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:14,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:14,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:14,623 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:14,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-14 15:06:14,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:14,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:14,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:14,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:14,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:14,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:14,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:14,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:14,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:14,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:14,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:14,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:14,662 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:14,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-14 15:06:14,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 [2022-07-14 15:06:14,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:14,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:14,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:14,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:14,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:14,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:14,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:06:14,750 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-14 15:06:14,750 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-07-14 15:06:14,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:14,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:14,753 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:14,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 15:06:14,804 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:06:14,822 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-14 15:06:14,822 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:06:14,823 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1) = -2*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1 Supporting invariants [-2*ULTIMATE.start_main_~n~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1 >= 0] [2022-07-14 15:06:14,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:14,855 INFO L293 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-07-14 15:06:14,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:14,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:06:14,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:14,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:06:14,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:06:15,010 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:06:15,011 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:15,104 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 61 states and 85 transitions. Complement of second has 9 states. [2022-07-14 15:06:15,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:06:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-07-14 15:06:15,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-14 15:06:15,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:15,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-14 15:06:15,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:15,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 4 letters. [2022-07-14 15:06:15,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:15,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 85 transitions. [2022-07-14 15:06:15,122 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-14 15:06:15,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 27 states and 38 transitions. [2022-07-14 15:06:15,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-14 15:06:15,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-07-14 15:06:15,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2022-07-14 15:06:15,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:06:15,129 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 38 transitions. [2022-07-14 15:06:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2022-07-14 15:06:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-14 15:06:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 15:06:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2022-07-14 15:06:15,151 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 38 transitions. [2022-07-14 15:06:15,151 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2022-07-14 15:06:15,151 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:06:15,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 38 transitions. [2022-07-14 15:06:15,153 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-14 15:06:15,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:15,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:15,153 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-14 15:06:15,153 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:06:15,154 INFO L752 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 160#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 162#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 149#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 155#merge_sortENTRY [2022-07-14 15:06:15,154 INFO L754 eck$LassoCheckResult]: Loop: 155#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 156#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 150#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 155#merge_sortENTRY [2022-07-14 15:06:15,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:15,154 INFO L85 PathProgramCache]: Analyzing trace with hash 85954193, now seen corresponding path program 1 times [2022-07-14 15:06:15,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:15,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734194259] [2022-07-14 15:06:15,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:15,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:06:15,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:15,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734194259] [2022-07-14 15:06:15,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734194259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:06:15,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:06:15,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:06:15,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193861648] [2022-07-14 15:06:15,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:06:15,200 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:06:15,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 1 times [2022-07-14 15:06:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:15,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270427914] [2022-07-14 15:06:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:15,211 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:15,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:15,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:15,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:06:15,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:06:15,353 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. cyclomatic complexity: 15 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:15,366 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-07-14 15:06:15,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:06:15,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 36 transitions. [2022-07-14 15:06:15,370 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-14 15:06:15,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 36 transitions. [2022-07-14 15:06:15,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-07-14 15:06:15,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-07-14 15:06:15,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2022-07-14 15:06:15,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:06:15,375 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-07-14 15:06:15,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2022-07-14 15:06:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-14 15:06:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 15:06:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-07-14 15:06:15,381 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-14 15:06:15,381 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-14 15:06:15,381 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:06:15,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2022-07-14 15:06:15,383 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-14 15:06:15,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:15,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:15,384 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:15,384 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:06:15,384 INFO L752 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 221#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 223#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 224#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 225#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 212#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 218#merge_sortENTRY [2022-07-14 15:06:15,385 INFO L754 eck$LassoCheckResult]: Loop: 218#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 219#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 210#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 218#merge_sortENTRY [2022-07-14 15:06:15,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:15,385 INFO L85 PathProgramCache]: Analyzing trace with hash 997650291, now seen corresponding path program 1 times [2022-07-14 15:06:15,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:15,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419891867] [2022-07-14 15:06:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:15,418 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:15,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:15,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:15,432 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 2 times [2022-07-14 15:06:15,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:15,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236646067] [2022-07-14 15:06:15,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:15,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:15,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:15,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash -173868929, now seen corresponding path program 1 times [2022-07-14 15:06:15,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:15,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767289069] [2022-07-14 15:06:15,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:06:15,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:15,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767289069] [2022-07-14 15:06:15,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767289069] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:06:15,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163158457] [2022-07-14 15:06:15,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:15,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:06:15,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:15,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:06:15,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 15:06:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:15,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:06:15,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:06:15,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:06:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:06:15,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163158457] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:06:15,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:06:15,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-14 15:06:15,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999977106] [2022-07-14 15:06:15,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:06:15,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:15,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:15,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 15:06:15,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 15:06:15,748 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:15,830 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-07-14 15:06:15,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 15:06:15,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2022-07-14 15:06:15,833 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-14 15:06:15,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 32 states and 41 transitions. [2022-07-14 15:06:15,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-14 15:06:15,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-14 15:06:15,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2022-07-14 15:06:15,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:06:15,836 INFO L369 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-14 15:06:15,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2022-07-14 15:06:15,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-07-14 15:06:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 15:06:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-14 15:06:15,839 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-14 15:06:15,839 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-14 15:06:15,839 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:06:15,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2022-07-14 15:06:15,839 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-14 15:06:15,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:15,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:15,840 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-07-14 15:06:15,840 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:06:15,840 INFO L752 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 355#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 356#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 358#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 359#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 360#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 361#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 372#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 346#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 351#merge_sortENTRY [2022-07-14 15:06:15,840 INFO L754 eck$LassoCheckResult]: Loop: 351#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 352#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 345#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 351#merge_sortENTRY [2022-07-14 15:06:15,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:15,841 INFO L85 PathProgramCache]: Analyzing trace with hash 964272085, now seen corresponding path program 2 times [2022-07-14 15:06:15,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:15,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351963086] [2022-07-14 15:06:15,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:15,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:15,864 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:15,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:15,874 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 3 times [2022-07-14 15:06:15,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:15,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234107873] [2022-07-14 15:06:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:15,879 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:15,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:15,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:15,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1888408797, now seen corresponding path program 2 times [2022-07-14 15:06:15,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:15,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298049412] [2022-07-14 15:06:15,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:15,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:15,897 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:15,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:16,390 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:06:16,390 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:06:16,391 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:06:16,391 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:06:16,391 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:06:16,391 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:16,391 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:06:16,391 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:06:16,391 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2022-07-14 15:06:16,391 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:06:16,391 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:06:16,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:16,936 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:06:16,936 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:06:16,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:16,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:16,937 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:16,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:16,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-14 15:06:16,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:16,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:16,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:16,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:16,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:16,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:16,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:16,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:16,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:16,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:16,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:16,985 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:16,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-14 15:06:16,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:16,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:16,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:16,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:16,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:16,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:16,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:16,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:16,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-14 15:06:17,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,015 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-14 15:06:17,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 [2022-07-14 15:06:17,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:17,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:17,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:17,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,053 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-14 15:06:17,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:17,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:17,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:17,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:17,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,107 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-14 15:06:17,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:17,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:17,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:17,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:17,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,137 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-14 15:06:17,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:17,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:17,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:17,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:17,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,167 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-14 15:06:17,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:17,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:17,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:17,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:17,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,196 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-14 15:06:17,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:17,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:17,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:17,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:17,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,223 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-14 15:06:17,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:17,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:17,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:17,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:17,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,281 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:17,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:17,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:17,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:17,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-14 15:06:17,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,330 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-14 15:06:17,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:17,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:17,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:17,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:17,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,358 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-14 15:06:17,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:17,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:17,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:17,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,444 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,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 [2022-07-14 15:06:17,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-14 15:06:17,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:17,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:17,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,491 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-14 15:06:17,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:17,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:17,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:17,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:17,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,554 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-14 15:06:17,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:17,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:17,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:17,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:17,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,621 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-14 15:06:17,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 [2022-07-14 15:06:17,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:17,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:17,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:17,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-14 15:06:17,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,654 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-14 15:06:17,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:17,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:17,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:17,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:17,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:17,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:17,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:17,687 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:06:17,708 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-14 15:06:17,708 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-14 15:06:17,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:17,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:17,710 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:17,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-14 15:06:17,711 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:06:17,718 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:06:17,718 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:06:17,718 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n#1) = 1*merge_sort_#in~n#1 Supporting invariants [] [2022-07-14 15:06:17,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:17,741 INFO L293 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2022-07-14 15:06:17,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:17,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:06:17,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:17,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 15:06:17,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:06:17,850 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-14 15:06:17,850 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 12 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:17,897 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 12. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 59 transitions. Complement of second has 12 states. [2022-07-14 15:06:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:06:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-07-14 15:06:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2022-07-14 15:06:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2022-07-14 15:06:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2022-07-14 15:06:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:17,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2022-07-14 15:06:17,904 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-14 15:06:17,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 38 states and 50 transitions. [2022-07-14 15:06:17,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-14 15:06:17,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-14 15:06:17,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. [2022-07-14 15:06:17,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:06:17,908 INFO L369 hiAutomatonCegarLoop]: Abstraction has 38 states and 50 transitions. [2022-07-14 15:06:17,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. [2022-07-14 15:06:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-07-14 15:06:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 15:06:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-07-14 15:06:17,916 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-07-14 15:06:17,916 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-07-14 15:06:17,916 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:06:17,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2022-07-14 15:06:17,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-14 15:06:17,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:17,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:17,920 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:17,920 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:17,921 INFO L752 eck$LassoCheckResult]: Stem: 524#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 510#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 511#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 513#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 514#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 515#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 516#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 531#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 500#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 504#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 505#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 498#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 506#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 507#L24 assume ~n#1 < 2; 522#merge_sortFINAL assume true; 521#merge_sortEXIT >#87#return; 499#L27-1 [2022-07-14 15:06:17,921 INFO L754 eck$LassoCheckResult]: Loop: 499#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 523#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 530#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 497#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 523#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 530#L24 assume ~n#1 < 2; 512#merge_sortFINAL assume true; 529#merge_sortEXIT >#87#return; 499#L27-1 [2022-07-14 15:06:17,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:17,921 INFO L85 PathProgramCache]: Analyzing trace with hash 825176348, now seen corresponding path program 1 times [2022-07-14 15:06:17,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:17,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822756040] [2022-07-14 15:06:17,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:17,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:17,957 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:17,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1429943866, now seen corresponding path program 1 times [2022-07-14 15:06:17,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:17,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23079811] [2022-07-14 15:06:17,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:17,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:18,010 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:18,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:18,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:18,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1545528235, now seen corresponding path program 1 times [2022-07-14 15:06:18,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:18,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475421985] [2022-07-14 15:06:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:18,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 15:06:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:18,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 15:06:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 15:06:18,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:18,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475421985] [2022-07-14 15:06:18,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475421985] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:06:18,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863253029] [2022-07-14 15:06:18,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:18,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:06:18,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:18,228 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:06:18,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-14 15:06:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:18,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 15:06:18,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:06:18,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:06:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 15:06:18,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863253029] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:06:18,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:06:18,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2022-07-14 15:06:18,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261290196] [2022-07-14 15:06:18,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:06:18,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:18,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 15:06:18,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-14 15:06:18,753 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 15 Second operand has 15 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-14 15:06:19,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:19,005 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-07-14 15:06:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 15:06:19,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 91 transitions. [2022-07-14 15:06:19,008 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2022-07-14 15:06:19,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 86 transitions. [2022-07-14 15:06:19,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-07-14 15:06:19,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2022-07-14 15:06:19,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 86 transitions. [2022-07-14 15:06:19,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:06:19,010 INFO L369 hiAutomatonCegarLoop]: Abstraction has 68 states and 86 transitions. [2022-07-14 15:06:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 86 transitions. [2022-07-14 15:06:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-07-14 15:06:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-14 15:06:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2022-07-14 15:06:19,014 INFO L392 hiAutomatonCegarLoop]: Abstraction has 65 states and 81 transitions. [2022-07-14 15:06:19,014 INFO L374 stractBuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2022-07-14 15:06:19,014 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:06:19,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 81 transitions. [2022-07-14 15:06:19,015 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2022-07-14 15:06:19,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:19,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:19,016 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:19,016 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:19,017 INFO L752 eck$LassoCheckResult]: Stem: 819#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 804#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 805#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 807#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 808#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 840#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 837#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 836#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 810#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 809#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 792#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 835#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 802#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 791#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 801#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 803#L24 assume ~n#1 < 2; 823#merge_sortFINAL assume true; 817#merge_sortEXIT >#87#return; 790#L27-1 [2022-07-14 15:06:19,017 INFO L754 eck$LassoCheckResult]: Loop: 790#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 799#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 800#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 793#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 799#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 800#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 793#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 799#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 800#L24 assume ~n#1 < 2; 853#merge_sortFINAL assume true; 852#merge_sortEXIT >#87#return; 790#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 799#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 800#L24 assume ~n#1 < 2; 853#merge_sortFINAL assume true; 852#merge_sortEXIT >#89#return; 833#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 830#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 829#L11-4 merge_~i~0#1 := 0; 827#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 795#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 796#L8 assume { :end_inline_merge } true; 806#merge_sortFINAL assume true; 818#merge_sortEXIT >#87#return; 790#L27-1 [2022-07-14 15:06:19,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 2 times [2022-07-14 15:06:19,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:19,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485588050] [2022-07-14 15:06:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:19,028 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:19,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:19,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:19,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1010329933, now seen corresponding path program 1 times [2022-07-14 15:06:19,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:19,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697509038] [2022-07-14 15:06:19,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:19,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 15:06:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:19,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 15:06:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:19,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 15:06:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 15:06:19,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:19,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697509038] [2022-07-14 15:06:19,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697509038] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:06:19,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995967500] [2022-07-14 15:06:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:19,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:06:19,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:19,128 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:06:19,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-14 15:06:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:19,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:06:19,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 15:06:19,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 15:06:19,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995967500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:06:19,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 15:06:19,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-07-14 15:06:19,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082707861] [2022-07-14 15:06:19,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:06:19,207 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:06:19,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:19,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:06:19,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:06:19,208 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 15:06:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:19,236 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2022-07-14 15:06:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 15:06:19,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 103 transitions. [2022-07-14 15:06:19,239 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2022-07-14 15:06:19,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 103 transitions. [2022-07-14 15:06:19,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2022-07-14 15:06:19,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2022-07-14 15:06:19,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 103 transitions. [2022-07-14 15:06:19,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:06:19,240 INFO L369 hiAutomatonCegarLoop]: Abstraction has 81 states and 103 transitions. [2022-07-14 15:06:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 103 transitions. [2022-07-14 15:06:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2022-07-14 15:06:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-14 15:06:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2022-07-14 15:06:19,244 INFO L392 hiAutomatonCegarLoop]: Abstraction has 67 states and 83 transitions. [2022-07-14 15:06:19,244 INFO L374 stractBuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2022-07-14 15:06:19,245 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:06:19,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2022-07-14 15:06:19,245 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2022-07-14 15:06:19,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:19,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:19,246 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:19,246 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:19,247 INFO L752 eck$LassoCheckResult]: Stem: 1077#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1060#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1061#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 1063#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1064#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1065#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1066#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1095#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1094#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1093#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1047#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1092#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1058#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1045#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1057#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1059#L24 assume ~n#1 < 2; 1110#merge_sortFINAL assume true; 1105#merge_sortEXIT >#87#return; 1048#L27-1 [2022-07-14 15:06:19,247 INFO L754 eck$LassoCheckResult]: Loop: 1048#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1103#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1096#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1046#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1103#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1096#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1046#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1103#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1096#L24 assume ~n#1 < 2; 1097#merge_sortFINAL assume true; 1107#merge_sortEXIT >#87#return; 1048#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1103#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1096#L24 assume ~n#1 < 2; 1097#merge_sortFINAL assume true; 1107#merge_sortEXIT >#89#return; 1069#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 1070#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1067#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 1068#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 1091#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 1090#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 1089#L11-4 merge_~i~0#1 := 0; 1087#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 1050#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 1051#L8 assume { :end_inline_merge } true; 1062#merge_sortFINAL assume true; 1106#merge_sortEXIT >#87#return; 1048#L27-1 [2022-07-14 15:06:19,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:19,247 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 3 times [2022-07-14 15:06:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:19,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110160237] [2022-07-14 15:06:19,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:19,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:19,257 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:19,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:19,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:19,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1032888824, now seen corresponding path program 1 times [2022-07-14 15:06:19,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:19,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499679063] [2022-07-14 15:06:19,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:19,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:19,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 15:06:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:19,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 15:06:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:19,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 15:06:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 15:06:19,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:19,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499679063] [2022-07-14 15:06:19,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499679063] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:06:19,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664796589] [2022-07-14 15:06:19,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:19,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:06:19,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:19,359 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:06:19,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-14 15:06:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:19,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 15:06:19,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 15:06:19,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:06:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 15:06:19,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664796589] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:06:19,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:06:19,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-07-14 15:06:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609655689] [2022-07-14 15:06:19,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:06:19,593 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:06:19,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:19,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 15:06:19,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-14 15:06:19,594 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. cyclomatic complexity: 23 Second operand has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 15:06:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:19,880 INFO L93 Difference]: Finished difference Result 162 states and 216 transitions. [2022-07-14 15:06:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 15:06:19,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 216 transitions. [2022-07-14 15:06:19,882 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 89 [2022-07-14 15:06:19,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 216 transitions. [2022-07-14 15:06:19,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2022-07-14 15:06:19,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2022-07-14 15:06:19,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 216 transitions. [2022-07-14 15:06:19,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:06:19,885 INFO L369 hiAutomatonCegarLoop]: Abstraction has 162 states and 216 transitions. [2022-07-14 15:06:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 216 transitions. [2022-07-14 15:06:19,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 79. [2022-07-14 15:06:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 68 states have internal predecessors, (82), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-14 15:06:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2022-07-14 15:06:19,898 INFO L392 hiAutomatonCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-07-14 15:06:19,899 INFO L374 stractBuchiCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-07-14 15:06:19,899 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 15:06:19,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 97 transitions. [2022-07-14 15:06:19,900 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 36 [2022-07-14 15:06:19,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:19,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:19,901 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:19,902 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:19,902 INFO L752 eck$LassoCheckResult]: Stem: 1547#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1528#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1529#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 1531#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1532#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1533#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1534#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1558#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1535#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1536#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1513#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1555#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1523#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1514#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1522#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1524#L24 assume ~n#1 < 2; 1569#merge_sortFINAL assume true; 1564#merge_sortEXIT >#87#return; 1512#L27-1 [2022-07-14 15:06:19,902 INFO L754 eck$LassoCheckResult]: Loop: 1512#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1560#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1556#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1515#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1560#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1556#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1515#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1560#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1556#L24 assume ~n#1 < 2; 1557#merge_sortFINAL assume true; 1566#merge_sortEXIT >#87#return; 1512#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1560#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1556#L24 assume ~n#1 < 2; 1557#merge_sortFINAL assume true; 1566#merge_sortEXIT >#89#return; 1538#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 1539#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1537#L12 assume !(merge_~j~0#1 == merge_~n#1); 1525#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 1526#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 1587#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 1589#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 1588#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 1570#L11-4 merge_~i~0#1 := 0; 1567#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 1517#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 1518#L8 assume { :end_inline_merge } true; 1530#merge_sortFINAL assume true; 1565#merge_sortEXIT >#87#return; 1512#L27-1 [2022-07-14 15:06:19,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 4 times [2022-07-14 15:06:19,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:19,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343910542] [2022-07-14 15:06:19,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:19,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:19,916 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:19,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash -245033989, now seen corresponding path program 1 times [2022-07-14 15:06:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:19,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427443] [2022-07-14 15:06:19,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:19,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:19,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 15:06:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:19,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 15:06:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:19,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 15:06:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 15:06:20,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:20,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427443] [2022-07-14 15:06:20,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:06:20,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:06:20,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 15:06:20,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178210040] [2022-07-14 15:06:20,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:06:20,003 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:06:20,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:20,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 15:06:20,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 15:06:20,003 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. cyclomatic complexity: 25 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 15:06:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:20,065 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-07-14 15:06:20,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 15:06:20,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 121 transitions. [2022-07-14 15:06:20,071 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 49 [2022-07-14 15:06:20,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 97 states and 121 transitions. [2022-07-14 15:06:20,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2022-07-14 15:06:20,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2022-07-14 15:06:20,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 121 transitions. [2022-07-14 15:06:20,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:06:20,073 INFO L369 hiAutomatonCegarLoop]: Abstraction has 97 states and 121 transitions. [2022-07-14 15:06:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 121 transitions. [2022-07-14 15:06:20,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-07-14 15:06:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 82 states have internal predecessors, (100), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-14 15:06:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2022-07-14 15:06:20,077 INFO L392 hiAutomatonCegarLoop]: Abstraction has 93 states and 115 transitions. [2022-07-14 15:06:20,077 INFO L374 stractBuchiCegarLoop]: Abstraction has 93 states and 115 transitions. [2022-07-14 15:06:20,077 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 15:06:20,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 115 transitions. [2022-07-14 15:06:20,078 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2022-07-14 15:06:20,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:20,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:20,079 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:20,079 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:20,079 INFO L752 eck$LassoCheckResult]: Stem: 1768#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1751#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1752#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 1754#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1755#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1756#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1757#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1785#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1786#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1787#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1736#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1782#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1746#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1737#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1745#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1747#L24 assume ~n#1 < 2; 1762#merge_sortFINAL assume true; 1763#merge_sortEXIT >#87#return; 1735#L27-1 [2022-07-14 15:06:20,079 INFO L754 eck$LassoCheckResult]: Loop: 1735#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1793#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1788#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1738#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1793#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1788#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1738#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1793#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1788#L24 assume ~n#1 < 2; 1789#merge_sortFINAL assume true; 1799#merge_sortEXIT >#87#return; 1735#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1793#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1788#L24 assume ~n#1 < 2; 1789#merge_sortFINAL assume true; 1799#merge_sortEXIT >#89#return; 1798#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 1769#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1770#L12 assume !(merge_~j~0#1 == merge_~n#1); 1815#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 1766#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 1734#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 1739#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 1826#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 1825#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 1824#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 1781#L11-4 merge_~i~0#1 := 0; 1779#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 1740#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 1741#L8 assume { :end_inline_merge } true; 1753#merge_sortFINAL assume true; 1797#merge_sortEXIT >#87#return; 1735#L27-1 [2022-07-14 15:06:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:20,080 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 5 times [2022-07-14 15:06:20,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:20,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865235683] [2022-07-14 15:06:20,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:20,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:20,088 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:20,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:20,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:20,095 INFO L85 PathProgramCache]: Analyzing trace with hash 357057537, now seen corresponding path program 1 times [2022-07-14 15:06:20,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:20,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841809910] [2022-07-14 15:06:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:20,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 15:06:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:20,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 15:06:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:20,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 15:06:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 15:06:20,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:20,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841809910] [2022-07-14 15:06:20,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841809910] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:06:20,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839155124] [2022-07-14 15:06:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:20,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:06:20,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:20,159 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:06:20,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-14 15:06:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:20,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:06:20,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 15:06:20,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:06:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 15:06:20,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839155124] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:06:20,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:06:20,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-07-14 15:06:20,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598296033] [2022-07-14 15:06:20,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:06:20,349 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:06:20,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:20,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 15:06:20,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-14 15:06:20,350 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. cyclomatic complexity: 29 Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 15:06:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:20,609 INFO L93 Difference]: Finished difference Result 183 states and 223 transitions. [2022-07-14 15:06:20,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 15:06:20,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 223 transitions. [2022-07-14 15:06:20,611 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 65 [2022-07-14 15:06:20,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 183 states and 223 transitions. [2022-07-14 15:06:20,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-07-14 15:06:20,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-07-14 15:06:20,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 223 transitions. [2022-07-14 15:06:20,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:06:20,614 INFO L369 hiAutomatonCegarLoop]: Abstraction has 183 states and 223 transitions. [2022-07-14 15:06:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 223 transitions. [2022-07-14 15:06:20,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2022-07-14 15:06:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 106 states have (on average 1.1981132075471699) internal successors, (127), 107 states have internal predecessors, (127), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-14 15:06:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2022-07-14 15:06:20,622 INFO L392 hiAutomatonCegarLoop]: Abstraction has 118 states and 142 transitions. [2022-07-14 15:06:20,622 INFO L374 stractBuchiCegarLoop]: Abstraction has 118 states and 142 transitions. [2022-07-14 15:06:20,623 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 15:06:20,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 142 transitions. [2022-07-14 15:06:20,623 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2022-07-14 15:06:20,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:20,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:20,628 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:20,628 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:20,628 INFO L752 eck$LassoCheckResult]: Stem: 2303#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2284#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2285#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 2287#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2288#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2289#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2290#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2321#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2320#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2319#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 2270#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2318#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2280#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2271#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2279#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2281#L24 assume ~n#1 < 2; 2336#merge_sortFINAL assume true; 2332#merge_sortEXIT >#87#return; 2269#L27-1 [2022-07-14 15:06:20,629 INFO L754 eck$LassoCheckResult]: Loop: 2269#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2328#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2325#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2272#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2328#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2325#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2272#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2328#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2325#L24 assume ~n#1 < 2; 2326#merge_sortFINAL assume true; 2335#merge_sortEXIT >#87#return; 2269#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2328#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2325#L24 assume ~n#1 < 2; 2326#merge_sortFINAL assume true; 2335#merge_sortEXIT >#89#return; 2334#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 2360#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 2359#L12 assume !(merge_~j~0#1 == merge_~n#1); 2358#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 2356#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 2355#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 2354#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 2353#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 2351#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 2350#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 2344#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 2345#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 2385#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 2384#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 2323#L11-4 merge_~i~0#1 := 0; 2322#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 2317#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 2316#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 2274#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 2275#L8 assume { :end_inline_merge } true; 2286#merge_sortFINAL assume true; 2333#merge_sortEXIT >#87#return; 2269#L27-1 [2022-07-14 15:06:20,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 6 times [2022-07-14 15:06:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:20,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574733360] [2022-07-14 15:06:20,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:20,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:20,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:20,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:20,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash 413165114, now seen corresponding path program 1 times [2022-07-14 15:06:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:20,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112525068] [2022-07-14 15:06:20,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:20,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 15:06:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:20,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 15:06:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:20,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 15:06:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 15:06:20,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:20,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112525068] [2022-07-14 15:06:20,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112525068] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:06:20,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565164948] [2022-07-14 15:06:20,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:20,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:06:20,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:20,788 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:06:20,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-14 15:06:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:20,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:06:20,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-14 15:06:20,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:06:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-14 15:06:20,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565164948] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:06:20,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:06:20,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2022-07-14 15:06:20,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277248777] [2022-07-14 15:06:20,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:06:20,969 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:06:20,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:20,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 15:06:20,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-14 15:06:20,970 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. cyclomatic complexity: 31 Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 15:06:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:21,321 INFO L93 Difference]: Finished difference Result 227 states and 287 transitions. [2022-07-14 15:06:21,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 15:06:21,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 287 transitions. [2022-07-14 15:06:21,324 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 113 [2022-07-14 15:06:21,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 227 states and 287 transitions. [2022-07-14 15:06:21,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2022-07-14 15:06:21,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 218 [2022-07-14 15:06:21,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 287 transitions. [2022-07-14 15:06:21,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:06:21,327 INFO L369 hiAutomatonCegarLoop]: Abstraction has 227 states and 287 transitions. [2022-07-14 15:06:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 287 transitions. [2022-07-14 15:06:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 120. [2022-07-14 15:06:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 109 states have internal predecessors, (129), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-14 15:06:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 144 transitions. [2022-07-14 15:06:21,340 INFO L392 hiAutomatonCegarLoop]: Abstraction has 120 states and 144 transitions. [2022-07-14 15:06:21,340 INFO L374 stractBuchiCegarLoop]: Abstraction has 120 states and 144 transitions. [2022-07-14 15:06:21,341 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-14 15:06:21,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 144 transitions. [2022-07-14 15:06:21,342 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2022-07-14 15:06:21,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:21,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:21,343 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:21,343 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:21,343 INFO L752 eck$LassoCheckResult]: Stem: 2947#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2931#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2932#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 2934#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2935#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2936#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2937#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2963#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2964#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2965#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 2920#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2960#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2927#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2921#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2926#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2928#L24 assume ~n#1 < 2; 2974#merge_sortFINAL assume true; 2970#merge_sortEXIT >#87#return; 2918#L27-1 [2022-07-14 15:06:21,343 INFO L754 eck$LassoCheckResult]: Loop: 2918#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2968#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2966#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2919#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2968#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2966#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2919#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2968#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2966#L24 assume ~n#1 < 2; 2967#merge_sortFINAL assume true; 2973#merge_sortEXIT >#87#return; 2918#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2968#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2966#L24 assume ~n#1 < 2; 2967#merge_sortFINAL assume true; 2973#merge_sortEXIT >#89#return; 2972#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 2999#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 3000#L12 assume !(merge_~j~0#1 == merge_~n#1); 2995#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 2996#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 3006#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 3005#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 3004#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 3003#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 3002#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 3001#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 2989#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 3017#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 3016#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 2978#L11-4 merge_~i~0#1 := 0; 2977#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 2976#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 2975#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 2962#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 2961#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 2917#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 2922#L8 assume { :end_inline_merge } true; 2933#merge_sortFINAL assume true; 2971#merge_sortEXIT >#87#return; 2918#L27-1 [2022-07-14 15:06:21,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:21,344 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 7 times [2022-07-14 15:06:21,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:21,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146084171] [2022-07-14 15:06:21,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:21,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:21,355 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:21,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:21,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:21,367 INFO L85 PathProgramCache]: Analyzing trace with hash -729143752, now seen corresponding path program 2 times [2022-07-14 15:06:21,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:21,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507381815] [2022-07-14 15:06:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:21,403 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:21,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:21,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:21,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1690449871, now seen corresponding path program 1 times [2022-07-14 15:06:21,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:21,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990548520] [2022-07-14 15:06:21,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:21,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:21,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 15:06:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:21,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 15:06:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:21,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 15:06:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:21,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 15:06:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 15:06:21,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:21,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990548520] [2022-07-14 15:06:21,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990548520] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:06:21,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501206398] [2022-07-14 15:06:21,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:21,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:06:21,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:21,678 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:06:21,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-14 15:06:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:21,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 15:06:21,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 15:06:21,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:06:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 15:06:22,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501206398] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:06:22,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:06:22,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 27 [2022-07-14 15:06:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259927758] [2022-07-14 15:06:22,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:06:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:26,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 15:06:26,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2022-07-14 15:06:26,206 INFO L87 Difference]: Start difference. First operand 120 states and 144 transitions. cyclomatic complexity: 31 Second operand has 28 states, 21 states have (on average 2.761904761904762) internal successors, (58), 23 states have internal predecessors, (58), 8 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-14 15:06:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:26,950 INFO L93 Difference]: Finished difference Result 337 states and 420 transitions. [2022-07-14 15:06:26,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-14 15:06:26,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 420 transitions. [2022-07-14 15:06:26,958 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 141 [2022-07-14 15:06:26,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 333 states and 416 transitions. [2022-07-14 15:06:26,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2022-07-14 15:06:26,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2022-07-14 15:06:26,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 333 states and 416 transitions. [2022-07-14 15:06:26,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:06:26,966 INFO L369 hiAutomatonCegarLoop]: Abstraction has 333 states and 416 transitions. [2022-07-14 15:06:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states and 416 transitions. [2022-07-14 15:06:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 238. [2022-07-14 15:06:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 214 states have (on average 1.2149532710280373) internal successors, (260), 217 states have internal predecessors, (260), 17 states have call successors, (17), 11 states have call predecessors, (17), 7 states have return successors, (19), 9 states have call predecessors, (19), 13 states have call successors, (19) [2022-07-14 15:06:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 296 transitions. [2022-07-14 15:06:26,983 INFO L392 hiAutomatonCegarLoop]: Abstraction has 238 states and 296 transitions. [2022-07-14 15:06:26,983 INFO L374 stractBuchiCegarLoop]: Abstraction has 238 states and 296 transitions. [2022-07-14 15:06:26,983 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-14 15:06:26,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 238 states and 296 transitions. [2022-07-14 15:06:26,985 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 96 [2022-07-14 15:06:26,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:26,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:26,986 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:26,986 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:06:26,986 INFO L752 eck$LassoCheckResult]: Stem: 3887#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3860#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 3861#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 3868#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 3869#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 3911#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 3910#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 3908#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 3909#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 3945#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 3884#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 3902#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3903#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 3857#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3855#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3858#L24 assume ~n#1 < 2; 3939#merge_sortFINAL assume true; 3936#merge_sortEXIT >#87#return; 3866#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 3883#merge_sortENTRY [2022-07-14 15:06:26,986 INFO L754 eck$LassoCheckResult]: Loop: 3883#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3906#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 3865#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3883#merge_sortENTRY [2022-07-14 15:06:26,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash 313135262, now seen corresponding path program 2 times [2022-07-14 15:06:26,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:26,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490696105] [2022-07-14 15:06:26,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:26,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:26,997 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:27,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:27,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:27,008 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 4 times [2022-07-14 15:06:27,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:27,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821050855] [2022-07-14 15:06:27,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:27,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:27,011 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:27,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:27,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash -56376460, now seen corresponding path program 3 times [2022-07-14 15:06:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:27,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489288606] [2022-07-14 15:06:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:27,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:27,035 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:27,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:27,881 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:06:27,881 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:06:27,881 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:06:27,881 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:06:27,881 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:06:27,881 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:27,881 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:06:27,881 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:06:27,881 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration12_Lasso [2022-07-14 15:06:27,881 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:06:27,881 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:06:27,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:27,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:28,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:28,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:28,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:28,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:28,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:28,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:28,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:28,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:28,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:28,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:28,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:28,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:28,330 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:06:28,330 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:06:28,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,334 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-14 15:06:28,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 [2022-07-14 15:06:28,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,354 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-14 15:06:28,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,371 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-14 15:06:28,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:28,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,396 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-14 15:06:28,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-14 15:06:28,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,424 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-14 15:06:28,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:28,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,453 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-14 15:06:28,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-14 15:06:28,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,479 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-14 15:06:28,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-14 15:06:28,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,505 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,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 [2022-07-14 15:06:28,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-14 15:06:28,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:28,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:28,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-14 15:06:28,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,541 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-14 15:06:28,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 [2022-07-14 15:06:28,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:28,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,573 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-14 15:06:28,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:28,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,634 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-14 15:06:28,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-14 15:06:28,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,676 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-14 15:06:28,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,716 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 [2022-07-14 15:06:28,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,718 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-14 15:06:28,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 [2022-07-14 15:06:28,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,747 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 [2022-07-14 15:06:28,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,748 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-14 15:06:28,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:28,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,781 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-14 15:06:28,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:28,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,806 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-14 15:06:28,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:28,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,832 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-14 15:06:28,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:28,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,858 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-14 15:06:28,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 [2022-07-14 15:06:28,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-14 15:06:28,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,894 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-14 15:06:28,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,919 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 [2022-07-14 15:06:28,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,921 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-14 15:06:28,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:28,979 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 [2022-07-14 15:06:28,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:28,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:28,980 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:28,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:28,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:28,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:28,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:28,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:28,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:28,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-14 15:06:28,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:28,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:28,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,009 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 [2022-07-14 15:06:29,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,010 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-14 15:06:29,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:29,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:29,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,037 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-14 15:06:29,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:29,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-14 15:06:29,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,080 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-14 15:06:29,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:29,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:29,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,133 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:29,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-14 15:06:29,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:29,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,177 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-14 15:06:29,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:29,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-14 15:06:29,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,203 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-14 15:06:29,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:29,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-14 15:06:29,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,228 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-14 15:06:29,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 [2022-07-14 15:06:29,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,258 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 [2022-07-14 15:06:29,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,260 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-14 15:06:29,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:29,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-14 15:06:29,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,286 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-14 15:06:29,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:29,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-14 15:06:29,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,312 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-14 15:06:29,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:29,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-07-14 15:06:29,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,338 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-14 15:06:29,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:29,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-14 15:06:29,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,364 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-14 15:06:29,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:29,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:29,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:29,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-14 15:06:29,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,392 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-14 15:06:29,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:29,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-14 15:06:29,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,418 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-14 15:06:29,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 [2022-07-14 15:06:29,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:29,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,444 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-14 15:06:29,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 [2022-07-14 15:06:29,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:29,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:29,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:29,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:29,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:29,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,513 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-14 15:06:29,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 [2022-07-14 15:06:29,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:29,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:29,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:29,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:29,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:29,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:29,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:06:29,570 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-14 15:06:29,570 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-14 15:06:29,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:29,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:29,572 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:29,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-14 15:06:29,573 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:06:29,616 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:06:29,616 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:06:29,616 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n#1) = 1*merge_sort_#in~n#1 Supporting invariants [] [2022-07-14 15:06:29,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:29,634 INFO L293 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-07-14 15:06:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:29,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 15:06:29,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:29,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 15:06:29,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:06:29,774 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-07-14 15:06:29,774 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 238 states and 296 transitions. cyclomatic complexity: 71 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 15:06:29,843 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 238 states and 296 transitions. cyclomatic complexity: 71. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 281 states and 363 transitions. Complement of second has 14 states. [2022-07-14 15:06:29,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:06:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 15:06:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-07-14 15:06:29,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 3 letters. [2022-07-14 15:06:29,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:29,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 22 letters. Loop has 3 letters. [2022-07-14 15:06:29,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:29,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 6 letters. [2022-07-14 15:06:29,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:29,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 363 transitions. [2022-07-14 15:06:29,849 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 96 [2022-07-14 15:06:29,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 269 states and 348 transitions. [2022-07-14 15:06:29,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2022-07-14 15:06:29,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2022-07-14 15:06:29,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 269 states and 348 transitions. [2022-07-14 15:06:29,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:06:29,853 INFO L369 hiAutomatonCegarLoop]: Abstraction has 269 states and 348 transitions. [2022-07-14 15:06:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states and 348 transitions. [2022-07-14 15:06:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 259. [2022-07-14 15:06:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 226 states have (on average 1.2256637168141593) internal successors, (277), 229 states have internal predecessors, (277), 24 states have call successors, (24), 16 states have call predecessors, (24), 9 states have return successors, (30), 13 states have call predecessors, (30), 20 states have call successors, (30) [2022-07-14 15:06:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 331 transitions. [2022-07-14 15:06:29,860 INFO L392 hiAutomatonCegarLoop]: Abstraction has 259 states and 331 transitions. [2022-07-14 15:06:29,860 INFO L374 stractBuchiCegarLoop]: Abstraction has 259 states and 331 transitions. [2022-07-14 15:06:29,860 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-14 15:06:29,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 331 transitions. [2022-07-14 15:06:29,862 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 96 [2022-07-14 15:06:29,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:29,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:29,862 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:29,862 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:29,863 INFO L752 eck$LassoCheckResult]: Stem: 4520#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4495#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4496#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 4502#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 4503#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4622#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 4618#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4616#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 4611#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4606#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 4498#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 4604#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4600#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 4477#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4517#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4631#L24 assume ~n#1 < 2; 4630#merge_sortFINAL assume true; 4594#merge_sortEXIT >#87#return; 4475#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 4526#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4491#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 4468#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4490#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4492#L24 assume ~n#1 < 2; 4596#merge_sortFINAL assume true; 4590#merge_sortEXIT >#87#return; 4476#L27-1 [2022-07-14 15:06:29,863 INFO L754 eck$LassoCheckResult]: Loop: 4476#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 4592#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4632#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 4472#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4592#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4632#L24 assume ~n#1 < 2; 4543#merge_sortFINAL assume true; 4588#merge_sortEXIT >#87#return; 4476#L27-1 [2022-07-14 15:06:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1251148749, now seen corresponding path program 4 times [2022-07-14 15:06:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:29,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979953438] [2022-07-14 15:06:29,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:29,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:29,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:29,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:29,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:29,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1429943866, now seen corresponding path program 2 times [2022-07-14 15:06:29,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:29,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064404622] [2022-07-14 15:06:29,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:29,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:29,889 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:29,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:29,892 INFO L85 PathProgramCache]: Analyzing trace with hash 826925164, now seen corresponding path program 5 times [2022-07-14 15:06:29,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:29,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786945197] [2022-07-14 15:06:29,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:29,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:30,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-07-14 15:06:30,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 15:06:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:30,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 15:06:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:30,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 15:06:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 15:06:30,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:30,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786945197] [2022-07-14 15:06:30,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786945197] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:06:30,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501408927] [2022-07-14 15:06:30,145 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 15:06:30,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:06:30,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:30,147 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:06:30,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-07-14 15:06:30,219 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-14 15:06:30,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:06:30,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 15:06:30,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-14 15:06:30,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:06:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-14 15:06:30,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501408927] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:06:30,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:06:30,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 24 [2022-07-14 15:06:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64635799] [2022-07-14 15:06:30,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:06:30,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:30,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 15:06:30,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-07-14 15:06:30,824 INFO L87 Difference]: Start difference. First operand 259 states and 331 transitions. cyclomatic complexity: 87 Second operand has 24 states, 15 states have (on average 2.4) internal successors, (36), 19 states have internal predecessors, (36), 11 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 15:06:31,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:31,369 INFO L93 Difference]: Finished difference Result 651 states and 815 transitions. [2022-07-14 15:06:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 15:06:31,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 651 states and 815 transitions. [2022-07-14 15:06:31,378 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 293 [2022-07-14 15:06:31,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 651 states to 648 states and 812 transitions. [2022-07-14 15:06:31,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 618 [2022-07-14 15:06:31,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 629 [2022-07-14 15:06:31,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 648 states and 812 transitions. [2022-07-14 15:06:31,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:06:31,388 INFO L369 hiAutomatonCegarLoop]: Abstraction has 648 states and 812 transitions. [2022-07-14 15:06:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states and 812 transitions. [2022-07-14 15:06:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 357. [2022-07-14 15:06:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 318 states have (on average 1.2138364779874213) internal successors, (386), 320 states have internal predecessors, (386), 28 states have call successors, (28), 18 states have call predecessors, (28), 11 states have return successors, (39), 18 states have call predecessors, (39), 24 states have call successors, (39) [2022-07-14 15:06:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 453 transitions. [2022-07-14 15:06:31,402 INFO L392 hiAutomatonCegarLoop]: Abstraction has 357 states and 453 transitions. [2022-07-14 15:06:31,402 INFO L374 stractBuchiCegarLoop]: Abstraction has 357 states and 453 transitions. [2022-07-14 15:06:31,402 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-14 15:06:31,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 357 states and 453 transitions. [2022-07-14 15:06:31,404 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 139 [2022-07-14 15:06:31,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:31,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:31,409 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:31,409 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:31,409 INFO L752 eck$LassoCheckResult]: Stem: 5695#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5674#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 5675#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 5680#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 5681#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 5682#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 5683#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 5716#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 5658#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 5707#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5772#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 5726#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 5730#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5748#L24 assume ~n#1 < 2; 5749#merge_sortFINAL assume true; 5725#merge_sortEXIT >#87#return; 5699#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 5700#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5701#L24 assume ~n#1 < 2; 5702#merge_sortFINAL assume true; 5905#merge_sortEXIT >#89#return; 5688#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 5689#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6001#L12 assume !(merge_~j~0#1 == merge_~n#1); 5667#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 5668#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 5998#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 5996#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 5997#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 6006#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 6004#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6002#L12 [2022-07-14 15:06:31,409 INFO L754 eck$LassoCheckResult]: Loop: 6002#L12 assume !(merge_~j~0#1 == merge_~n#1); 6000#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 5693#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 5694#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6008#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 6007#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 6005#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 6003#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6002#L12 [2022-07-14 15:06:31,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:31,410 INFO L85 PathProgramCache]: Analyzing trace with hash 309875929, now seen corresponding path program 1 times [2022-07-14 15:06:31,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:31,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547313624] [2022-07-14 15:06:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:31,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:31,426 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:31,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times [2022-07-14 15:06:31,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:31,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127253707] [2022-07-14 15:06:31,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:31,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:31,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:31,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1231791987, now seen corresponding path program 2 times [2022-07-14 15:06:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:31,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812872445] [2022-07-14 15:06:31,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:31,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:31,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 15:06:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:31,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 15:06:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 15:06:31,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:31,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812872445] [2022-07-14 15:06:31,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812872445] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:06:31,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048865431] [2022-07-14 15:06:31,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:06:31,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:06:31,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:31,548 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:06:31,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-07-14 15:06:31,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:06:31,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:06:31,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 15:06:31,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 15:06:31,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:06:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 15:06:31,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048865431] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:06:31,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:06:31,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-07-14 15:06:31,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331414143] [2022-07-14 15:06:31,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:06:31,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:31,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 15:06:31,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-07-14 15:06:31,927 INFO L87 Difference]: Start difference. First operand 357 states and 453 transitions. cyclomatic complexity: 112 Second operand has 17 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 15:06:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:32,173 INFO L93 Difference]: Finished difference Result 395 states and 495 transitions. [2022-07-14 15:06:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 15:06:32,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 395 states and 495 transitions. [2022-07-14 15:06:32,179 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 141 [2022-07-14 15:06:32,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 395 states to 395 states and 495 transitions. [2022-07-14 15:06:32,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2022-07-14 15:06:32,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 376 [2022-07-14 15:06:32,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 395 states and 495 transitions. [2022-07-14 15:06:32,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:06:32,184 INFO L369 hiAutomatonCegarLoop]: Abstraction has 395 states and 495 transitions. [2022-07-14 15:06:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states and 495 transitions. [2022-07-14 15:06:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 382. [2022-07-14 15:06:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 343 states have (on average 1.2099125364431487) internal successors, (415), 344 states have internal predecessors, (415), 28 states have call successors, (28), 18 states have call predecessors, (28), 11 states have return successors, (39), 19 states have call predecessors, (39), 24 states have call successors, (39) [2022-07-14 15:06:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 482 transitions. [2022-07-14 15:06:32,195 INFO L392 hiAutomatonCegarLoop]: Abstraction has 382 states and 482 transitions. [2022-07-14 15:06:32,195 INFO L374 stractBuchiCegarLoop]: Abstraction has 382 states and 482 transitions. [2022-07-14 15:06:32,195 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-14 15:06:32,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 382 states and 482 transitions. [2022-07-14 15:06:32,197 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 139 [2022-07-14 15:06:32,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:32,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:32,198 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:32,198 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:32,198 INFO L752 eck$LassoCheckResult]: Stem: 6724#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6701#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 6702#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 6704#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 6705#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 6706#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 6707#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 6750#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 6751#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 6746#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 6691#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 6740#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6865#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 6858#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6859#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6697#L24 assume ~n#1 < 2; 6863#merge_sortFINAL assume true; 6857#merge_sortEXIT >#87#return; 6714#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 6836#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6875#L24 assume ~n#1 < 2; 6872#merge_sortFINAL assume true; 6867#merge_sortEXIT >#89#return; 6855#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 6969#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6967#L12 assume !(merge_~j~0#1 == merge_~n#1); 6965#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 6963#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 6960#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6958#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 6956#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 6954#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 6952#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6950#L12 [2022-07-14 15:06:32,199 INFO L754 eck$LassoCheckResult]: Loop: 6950#L12 assume !(merge_~j~0#1 == merge_~n#1); 6951#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 6961#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 6962#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6948#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 6949#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 6907#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 6908#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6950#L12 [2022-07-14 15:06:32,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:32,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2045280059, now seen corresponding path program 3 times [2022-07-14 15:06:32,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:32,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705228447] [2022-07-14 15:06:32,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:32,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:32,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 15:06:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:32,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 15:06:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 15:06:32,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:32,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705228447] [2022-07-14 15:06:32,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705228447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:06:32,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444789359] [2022-07-14 15:06:32,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 15:06:32,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:06:32,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:32,307 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:06:32,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-07-14 15:06:32,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 15:06:32,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:06:32,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 15:06:32,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 15:06:32,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:06:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 15:06:32,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444789359] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:06:32,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:06:32,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 16 [2022-07-14 15:06:32,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057093926] [2022-07-14 15:06:32,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:06:32,565 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:06:32,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:32,565 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2022-07-14 15:06:32,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:32,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146217651] [2022-07-14 15:06:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:32,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:32,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:32,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:32,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:32,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 15:06:32,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-14 15:06:32,741 INFO L87 Difference]: Start difference. First operand 382 states and 482 transitions. cyclomatic complexity: 116 Second operand has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 15:06:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:33,033 INFO L93 Difference]: Finished difference Result 562 states and 697 transitions. [2022-07-14 15:06:33,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 15:06:33,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 697 transitions. [2022-07-14 15:06:33,038 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 229 [2022-07-14 15:06:33,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 550 states and 685 transitions. [2022-07-14 15:06:33,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 529 [2022-07-14 15:06:33,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 529 [2022-07-14 15:06:33,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 550 states and 685 transitions. [2022-07-14 15:06:33,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:06:33,043 INFO L369 hiAutomatonCegarLoop]: Abstraction has 550 states and 685 transitions. [2022-07-14 15:06:33,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states and 685 transitions. [2022-07-14 15:06:33,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 386. [2022-07-14 15:06:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 344 states have (on average 1.2093023255813953) internal successors, (416), 346 states have internal predecessors, (416), 31 states have call successors, (31), 18 states have call predecessors, (31), 11 states have return successors, (42), 21 states have call predecessors, (42), 27 states have call successors, (42) [2022-07-14 15:06:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 489 transitions. [2022-07-14 15:06:33,054 INFO L392 hiAutomatonCegarLoop]: Abstraction has 386 states and 489 transitions. [2022-07-14 15:06:33,054 INFO L374 stractBuchiCegarLoop]: Abstraction has 386 states and 489 transitions. [2022-07-14 15:06:33,054 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-14 15:06:33,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 489 transitions. [2022-07-14 15:06:33,056 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 139 [2022-07-14 15:06:33,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:33,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:33,057 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:33,057 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:06:33,057 INFO L752 eck$LassoCheckResult]: Stem: 7907#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7885#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 7886#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 7888#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 7889#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 7890#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 7891#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 7925#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 7903#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 7915#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7944#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 7902#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 7904#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8013#L24 assume ~n#1 < 2; 8012#merge_sortFINAL assume true; 8011#merge_sortEXIT >#87#return; 7875#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 7874#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7876#L24 assume ~n#1 < 2; 7911#merge_sortFINAL assume true; 7896#merge_sortEXIT >#89#return; 7897#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 8239#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 8238#L12 assume !(merge_~j~0#1 == merge_~n#1); 8237#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 8236#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 8234#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 8232#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 8230#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 8228#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 8226#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 8223#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 8224#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 8205#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 7943#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 7914#L11-4 merge_~i~0#1 := 0; 7910#L17-3 [2022-07-14 15:06:33,057 INFO L754 eck$LassoCheckResult]: Loop: 7910#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 7909#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 7910#L17-3 [2022-07-14 15:06:33,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2097782888, now seen corresponding path program 1 times [2022-07-14 15:06:33,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:33,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138221141] [2022-07-14 15:06:33,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:33,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:33,072 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:33,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:33,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:33,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2022-07-14 15:06:33,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:33,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235069009] [2022-07-14 15:06:33,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:33,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:33,089 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:33,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:33,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:33,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1629691942, now seen corresponding path program 1 times [2022-07-14 15:06:33,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:33,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044019992] [2022-07-14 15:06:33,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:33,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:33,110 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:33,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:35,412 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:06:35,412 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:06:35,412 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:06:35,412 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:06:35,412 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:06:35,412 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:35,412 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:06:35,412 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:06:35,412 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration16_Lasso [2022-07-14 15:06:35,412 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:06:35,412 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:06:35,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:35,653 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-14 15:06:35,657 INFO L158 Benchmark]: Toolchain (without parser) took 22782.17ms. Allocated memory was 96.5MB in the beginning and 218.1MB in the end (delta: 121.6MB). Free memory was 63.2MB in the beginning and 101.6MB in the end (delta: -38.4MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2022-07-14 15:06:35,657 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:06:35,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.67ms. Allocated memory is still 96.5MB. Free memory was 63.0MB in the beginning and 72.0MB in the end (delta: -8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 15:06:35,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.98ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 70.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:06:35,658 INFO L158 Benchmark]: Boogie Preprocessor took 21.25ms. Allocated memory is still 96.5MB. Free memory was 70.0MB in the beginning and 68.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:06:35,659 INFO L158 Benchmark]: RCFGBuilder took 285.61ms. Allocated memory is still 96.5MB. Free memory was 68.8MB in the beginning and 56.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 15:06:35,659 INFO L158 Benchmark]: BuchiAutomizer took 22247.40ms. Allocated memory was 96.5MB in the beginning and 218.1MB in the end (delta: 121.6MB). Free memory was 56.5MB in the beginning and 101.6MB in the end (delta: -45.1MB). Peak memory consumption was 126.7MB. Max. memory is 16.1GB. [2022-07-14 15:06:35,660 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.67ms. Allocated memory is still 96.5MB. Free memory was 63.0MB in the beginning and 72.0MB in the end (delta: -8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.98ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 70.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.25ms. Allocated memory is still 96.5MB. Free memory was 70.0MB in the beginning and 68.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 285.61ms. Allocated memory is still 96.5MB. Free memory was 68.8MB in the beginning and 56.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 22247.40ms. Allocated memory was 96.5MB in the beginning and 218.1MB in the end (delta: 121.6MB). Free memory was 56.5MB in the beginning and 101.6MB in the end (delta: -45.1MB). Peak memory consumption was 126.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 15:06:35,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-07-14 15:06:35,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2022-07-14 15:06:36,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-07-14 15:06:36,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-07-14 15:06:36,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:36,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-07-14 15:06:36,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-07-14 15:06:37,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-07-14 15:06:37,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-07-14 15:06:37,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-14 15:06:37,678 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: IllegalArgumentException: null