./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 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-3598765 [2022-07-22 01:43:53,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:43:53,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:43:53,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:43:53,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:43:53,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:43:53,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:43:53,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:43:53,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:43:53,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:43:53,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:43:53,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:43:53,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:43:53,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:43:53,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:43:53,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:43:53,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:43:53,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:43:53,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:43:53,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:43:53,316 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:43:53,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:43:53,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:43:53,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:43:53,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:43:53,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:43:53,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:43:53,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:43:53,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:43:53,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:43:53,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:43:53,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:43:53,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:43:53,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:43:53,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:43:53,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:43:53,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:43:53,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:43:53,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:43:53,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:43:53,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:43:53,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:43:53,345 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-22 01:43:53,375 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:43:53,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:43:53,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:43:53,376 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:43:53,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:43:53,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:43:53,378 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:43:53,378 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:43:53,378 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:43:53,379 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:43:53,379 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:43:53,379 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:43:53,379 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:43:53,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:43:53,380 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:43:53,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:43:53,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:43:53,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:43:53,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:43:53,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:43:53,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:43:53,381 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:43:53,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:43:53,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:43:53,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:43:53,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:43:53,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:43:53,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:43:53,384 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:43:53,384 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-22 01:43:53,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:43:53,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:43:53,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:43:53,723 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:43:53,724 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:43:53,727 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-22 01:43:53,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f74901fc4/aeecd105db054cf6b46c8e061e93fcb4/FLAG3d93b9a77 [2022-07-22 01:43:54,173 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:43:54,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2022-07-22 01:43:54,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f74901fc4/aeecd105db054cf6b46c8e061e93fcb4/FLAG3d93b9a77 [2022-07-22 01:43:54,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f74901fc4/aeecd105db054cf6b46c8e061e93fcb4 [2022-07-22 01:43:54,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:43:54,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:43:54,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:43:54,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:43:54,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:43:54,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:43:54" (1/1) ... [2022-07-22 01:43:54,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@682da75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:54, skipping insertion in model container [2022-07-22 01:43:54,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:43:54" (1/1) ... [2022-07-22 01:43:54,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:43:54,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:43:54,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:43:54,429 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:43:54,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:43:54,506 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:43:54,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:54 WrapperNode [2022-07-22 01:43:54,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:43:54,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:43:54,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:43:54,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:43:54,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:54" (1/1) ... [2022-07-22 01:43:54,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:54" (1/1) ... [2022-07-22 01:43:54,557 INFO L137 Inliner]: procedures = 12, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2022-07-22 01:43:54,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:43:54,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:43:54,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:43:54,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:43:54,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:54" (1/1) ... [2022-07-22 01:43:54,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:54" (1/1) ... [2022-07-22 01:43:54,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:54" (1/1) ... [2022-07-22 01:43:54,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:54" (1/1) ... [2022-07-22 01:43:54,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:54" (1/1) ... [2022-07-22 01:43:54,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:54" (1/1) ... [2022-07-22 01:43:54,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:54" (1/1) ... [2022-07-22 01:43:54,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:43:54,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:43:54,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:43:54,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:43:54,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:54" (1/1) ... [2022-07-22 01:43:54,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:54,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:54,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:54,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 01:43:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 01:43:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2022-07-22 01:43:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2022-07-22 01:43:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 01:43:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:43:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:43:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 01:43:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 01:43:54,772 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:43:54,773 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:43:54,967 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:43:54,973 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:43:54,973 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 01:43:54,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:43:54 BoogieIcfgContainer [2022-07-22 01:43:54,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:43:54,976 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:43:54,976 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:43:54,996 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:43:54,996 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:43:54,997 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:43:54" (1/3) ... [2022-07-22 01:43:54,997 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@332b04fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:43:54, skipping insertion in model container [2022-07-22 01:43:54,997 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:43:54,998 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:54" (2/3) ... [2022-07-22 01:43:54,998 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@332b04fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:43:54, skipping insertion in model container [2022-07-22 01:43:54,998 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:43:54,998 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:43:54" (3/3) ... [2022-07-22 01:43:54,999 INFO L354 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2022-07-22 01:43:55,058 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:43:55,058 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:43:55,059 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:43:55,059 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:43:55,059 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:43:55,059 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:43:55,059 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:43:55,060 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:43:55,065 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-22 01:43:55,112 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-07-22 01:43:55,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:55,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:55,118 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 01:43:55,118 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:43:55,118 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:43:55,119 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-22 01:43:55,122 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-07-22 01:43:55,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:55,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:55,122 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 01:43:55,123 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:43:55,128 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-22 01:43:55,129 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-22 01:43:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:55,135 INFO L85 PathProgramCache]: Analyzing trace with hash 89440, now seen corresponding path program 1 times [2022-07-22 01:43:55,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:55,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479211237] [2022-07-22 01:43:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:55,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:55,256 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:55,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:55,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:55,299 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2022-07-22 01:43:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:55,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715100894] [2022-07-22 01:43:55,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:55,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:55,324 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:55,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:55,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash 85954242, now seen corresponding path program 1 times [2022-07-22 01:43:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:55,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723784953] [2022-07-22 01:43:55,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:55,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:55,386 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:55,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:55,628 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:43:55,629 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:43:55,629 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:43:55,629 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:43:55,629 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:43:55,630 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:55,630 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:43:55,630 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:43:55,630 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2022-07-22 01:43:55,630 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:43:55,630 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:43:55,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:55,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:55,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:55,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:55,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:55,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:55,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:55,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:55,919 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:43:55,923 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:43:55,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:55,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:55,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:55,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:55,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:55,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:55,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:55,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:55,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:55,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:55,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:55,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 01:43:55,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:55,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:55,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:55,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:55,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:55,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:55,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 01:43:56,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:56,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:56,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:56,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:56,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:56,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:56,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:56,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:56,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:56,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:56,042 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:56,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 01:43:56,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:56,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:56,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:56,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:56,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:56,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:56,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:56,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:56,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:56,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:56,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:56,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:56,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:56,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 01:43:56,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-22 01:43:56,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:56,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:56,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:56,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:56,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:56,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:56,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:56,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:56,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:56,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:56,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:56,110 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:56,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 01:43:56,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:56,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:56,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:56,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:56,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:56,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:56,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:56,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:56,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:56,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:56,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:56,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:56,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:56,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:56,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:56,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:56,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:56,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:56,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:56,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:56,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 01:43:56,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:56,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:56,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:56,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:56,213 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:56,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 01:43:56,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:56,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:56,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:56,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:56,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:56,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:56,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:56,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:56,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:56,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:56,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:56,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:56,251 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:56,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 01:43:56,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:56,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:56,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:56,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:56,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:56,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:56,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:56,295 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:43:56,326 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 01:43:56,327 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-07-22 01:43:56,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:56,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:56,335 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:56,343 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:43:56,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 01:43:56,365 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 01:43:56,365 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:43:56,366 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-22 01:43:56,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:56,405 INFO L293 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-07-22 01:43:56,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:56,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 01:43:56,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:43:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:56,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 01:43:56,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:43:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:43:56,544 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 01:43:56,546 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-22 01:43:56,638 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-22 01:43:56,639 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-22 01:43:56,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:43:56,645 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-22 01:43:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-07-22 01:43:56,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-22 01:43:56,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:56,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 01:43:56,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:56,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 4 letters. [2022-07-22 01:43:56,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:56,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 85 transitions. [2022-07-22 01:43:56,655 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-22 01:43:56,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 27 states and 38 transitions. [2022-07-22 01:43:56,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-22 01:43:56,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-07-22 01:43:56,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2022-07-22 01:43:56,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:43:56,664 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 38 transitions. [2022-07-22 01:43:56,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2022-07-22 01:43:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-22 01:43:56,688 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-22 01:43:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2022-07-22 01:43:56,690 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 38 transitions. [2022-07-22 01:43:56,690 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2022-07-22 01:43:56,690 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:43:56,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 38 transitions. [2022-07-22 01:43:56,691 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-22 01:43:56,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:56,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:56,692 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 01:43:56,692 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:43:56,692 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-22 01:43:56,693 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-22 01:43:56,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:56,693 INFO L85 PathProgramCache]: Analyzing trace with hash 85954193, now seen corresponding path program 1 times [2022-07-22 01:43:56,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:56,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131355417] [2022-07-22 01:43:56,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:56,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:56,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:43:56,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:43:56,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131355417] [2022-07-22 01:43:56,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131355417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:43:56,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:43:56,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:43:56,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849999784] [2022-07-22 01:43:56,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:43:56,735 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:43:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:56,736 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 1 times [2022-07-22 01:43:56,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:56,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758847775] [2022-07-22 01:43:56,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:56,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:56,749 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:56,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:56,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:43:56,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:43:56,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:43:56,901 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-22 01:43:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:43:56,923 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-07-22 01:43:56,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:43:56,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 36 transitions. [2022-07-22 01:43:56,925 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-22 01:43:56,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 36 transitions. [2022-07-22 01:43:56,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-07-22 01:43:56,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-07-22 01:43:56,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2022-07-22 01:43:56,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:43:56,928 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-07-22 01:43:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2022-07-22 01:43:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-22 01:43:56,942 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-22 01:43:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-07-22 01:43:56,943 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-22 01:43:56,943 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-22 01:43:56,943 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:43:56,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2022-07-22 01:43:56,944 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-22 01:43:56,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:56,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:56,945 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:43:56,945 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:43:56,945 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-22 01:43:56,945 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-22 01:43:56,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash 997650291, now seen corresponding path program 1 times [2022-07-22 01:43:56,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:56,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636689488] [2022-07-22 01:43:56,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:56,959 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:56,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:56,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:56,972 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 2 times [2022-07-22 01:43:56,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:56,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317288605] [2022-07-22 01:43:56,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:56,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:56,979 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:56,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:56,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:56,987 INFO L85 PathProgramCache]: Analyzing trace with hash -173868929, now seen corresponding path program 1 times [2022-07-22 01:43:56,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:56,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671719033] [2022-07-22 01:43:56,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:56,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:43:57,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:43:57,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671719033] [2022-07-22 01:43:57,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671719033] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:43:57,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649006013] [2022-07-22 01:43:57,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:57,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:43:57,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:57,052 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-22 01:43:57,074 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-22 01:43:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:57,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:43:57,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:43:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:43:57,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:43:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:43:57,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649006013] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:43:57,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:43:57,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-22 01:43:57,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438882349] [2022-07-22 01:43:57,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:43:57,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:43:57,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 01:43:57,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 01:43:57,307 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-22 01:43:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:43:57,367 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-07-22 01:43:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 01:43:57,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2022-07-22 01:43:57,369 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-22 01:43:57,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 32 states and 41 transitions. [2022-07-22 01:43:57,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-22 01:43:57,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-22 01:43:57,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2022-07-22 01:43:57,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:43:57,373 INFO L369 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-22 01:43:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2022-07-22 01:43:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-07-22 01:43:57,375 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-22 01:43:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-22 01:43:57,376 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-22 01:43:57,376 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-22 01:43:57,376 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:43:57,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2022-07-22 01:43:57,377 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-22 01:43:57,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:57,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:57,378 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-07-22 01:43:57,378 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:43:57,378 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-22 01:43:57,379 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-22 01:43:57,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:57,379 INFO L85 PathProgramCache]: Analyzing trace with hash 964272085, now seen corresponding path program 2 times [2022-07-22 01:43:57,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:57,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552377764] [2022-07-22 01:43:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:57,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:57,392 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:57,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:57,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:57,405 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 3 times [2022-07-22 01:43:57,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:57,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021176997] [2022-07-22 01:43:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:57,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:57,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:57,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1888408797, now seen corresponding path program 2 times [2022-07-22 01:43:57,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:57,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943790679] [2022-07-22 01:43:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:57,440 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:57,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:57,983 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:43:57,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:43:57,983 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:43:57,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:43:57,983 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:43:57,983 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:57,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:43:57,983 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:43:57,984 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2022-07-22 01:43:57,984 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:43:57,984 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:43:57,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:57,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:57,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:57,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:57,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:57,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:58,508 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:43:58,508 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:43:58,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:58,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:58,512 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:58,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:58,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 01:43:58,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:58,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:58,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:58,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:58,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:58,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:58,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:58,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:58,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:58,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:58,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:58,557 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:58,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 01:43:58,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:58,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:58,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:58,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:58,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:58,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:58,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:58,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:58,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:58,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:58,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:58,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:58,593 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:58,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 01:43:58,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:58,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:58,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:58,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:58,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:58,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:58,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:58,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:58,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:58,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:58,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:58,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:58,649 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:58,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 01:43:58,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:58,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:58,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:58,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:58,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:58,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:58,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:58,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:58,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:58,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-22 01:43:58,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:58,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:58,701 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:58,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 01:43:58,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:58,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:58,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:58,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:58,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:58,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:58,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:58,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:58,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:58,727 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-22 01:43:58,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:58,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:58,729 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:58,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 01:43:58,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:58,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:58,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:58,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:58,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:58,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:58,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:58,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:58,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:58,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-22 01:43:58,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:58,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:58,765 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:58,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 01:43:58,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:58,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:58,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:58,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:58,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:58,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:58,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:58,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:58,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:58,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:58,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:58,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:58,796 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:58,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 01:43:58,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:58,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:58,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:58,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:58,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:58,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:58,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:58,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:58,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:58,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:58,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:58,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:58,824 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:58,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 01:43:58,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:58,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:58,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:58,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:58,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:58,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:58,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:58,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:58,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:58,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:58,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:58,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:58,856 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:58,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 01:43:58,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:58,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:58,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:58,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:58,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:58,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:58,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:58,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:58,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:58,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:58,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:58,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:58,910 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:58,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 01:43:58,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:58,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:58,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:58,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:58,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:58,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:58,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:58,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:58,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:58,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:58,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:58,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:58,939 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:58,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 01:43:58,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:58,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:58,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:58,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:58,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:58,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:58,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:58,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:58,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:58,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:58,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:58,979 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:58,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 01:43:59,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:59,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:59,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:59,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:59,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:59,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:59,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:59,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:59,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:59,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:59,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:59,055 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:59,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 01:43:59,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:59,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:59,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:59,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:59,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:59,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:59,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:59,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:59,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:59,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:59,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:59,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:59,119 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:59,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:59,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:59,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:59,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:59,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:59,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:59,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:59,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:59,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 01:43:59,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:59,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:59,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:59,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:59,175 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:43:59,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:59,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:59,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:59,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:59,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:59,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:59,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:59,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 01:43:59,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:59,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:59,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:59,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:59,239 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-22 01:43:59,239 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-22 01:43:59,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:59,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:59,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:59,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:59,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:59,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:59,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:59,287 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:43:59,300 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-22 01:43:59,300 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-22 01:43:59,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:59,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:59,307 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-22 01:43:59,312 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:43:59,321 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-22 01:43:59,322 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:43:59,322 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:43:59,322 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-22 01:43:59,338 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-22 01:43:59,341 INFO L293 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2022-07-22 01:43:59,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:59,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:43:59,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:43:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:59,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:43:59,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:43:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:43:59,441 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-22 01:43:59,442 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-22 01:43:59,482 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-22 01:43:59,483 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-22 01:43:59,483 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-22 01:43:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-07-22 01:43:59,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2022-07-22 01:43:59,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:59,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2022-07-22 01:43:59,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:59,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2022-07-22 01:43:59,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:59,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2022-07-22 01:43:59,487 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-22 01:43:59,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 38 states and 50 transitions. [2022-07-22 01:43:59,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-22 01:43:59,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-22 01:43:59,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. [2022-07-22 01:43:59,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:43:59,489 INFO L369 hiAutomatonCegarLoop]: Abstraction has 38 states and 50 transitions. [2022-07-22 01:43:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. [2022-07-22 01:43:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-07-22 01:43:59,492 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-22 01:43:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-07-22 01:43:59,493 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-07-22 01:43:59,493 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-07-22 01:43:59,493 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:43:59,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2022-07-22 01:43:59,494 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-22 01:43:59,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:59,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:59,495 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:43:59,495 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 01:43:59,496 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-22 01:43:59,496 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-22 01:43:59,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:59,496 INFO L85 PathProgramCache]: Analyzing trace with hash 825176348, now seen corresponding path program 1 times [2022-07-22 01:43:59,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:59,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648915368] [2022-07-22 01:43:59,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:59,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:59,514 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:59,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:59,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:59,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1429943866, now seen corresponding path program 1 times [2022-07-22 01:43:59,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:59,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468829156] [2022-07-22 01:43:59,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:59,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:59,575 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:59,581 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-22 01:43:59,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:59,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1545528235, now seen corresponding path program 1 times [2022-07-22 01:43:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:59,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158712060] [2022-07-22 01:43:59,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:59,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:59,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 01:43:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:59,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 01:43:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:59,758 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-22 01:43:59,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:43:59,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158712060] [2022-07-22 01:43:59,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158712060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:43:59,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077458594] [2022-07-22 01:43:59,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:59,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:43:59,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:59,761 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:43:59,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-22 01:43:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:59,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 01:43:59,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:43:59,898 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-22 01:43:59,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:43:59,965 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-22 01:43:59,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077458594] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:43:59,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:43:59,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2022-07-22 01:43:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959845417] [2022-07-22 01:43:59,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:44:00,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:44:00,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 01:44:00,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-22 01:44:00,292 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-22 01:44:00,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:44:00,544 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-07-22 01:44:00,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 01:44:00,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 91 transitions. [2022-07-22 01:44:00,546 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2022-07-22 01:44:00,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 86 transitions. [2022-07-22 01:44:00,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-07-22 01:44:00,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2022-07-22 01:44:00,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 86 transitions. [2022-07-22 01:44:00,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:44:00,555 INFO L369 hiAutomatonCegarLoop]: Abstraction has 68 states and 86 transitions. [2022-07-22 01:44:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 86 transitions. [2022-07-22 01:44:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-07-22 01:44:00,560 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-22 01:44:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2022-07-22 01:44:00,561 INFO L392 hiAutomatonCegarLoop]: Abstraction has 65 states and 81 transitions. [2022-07-22 01:44:00,562 INFO L374 stractBuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2022-07-22 01:44:00,562 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:44:00,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 81 transitions. [2022-07-22 01:44:00,563 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2022-07-22 01:44:00,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:44:00,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:44:00,564 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:44:00,564 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:44:00,564 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-22 01:44:00,565 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-22 01:44:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:00,565 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 2 times [2022-07-22 01:44:00,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:00,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835809865] [2022-07-22 01:44:00,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:00,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:00,580 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:00,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1010329933, now seen corresponding path program 1 times [2022-07-22 01:44:00,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:00,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777035559] [2022-07-22 01:44:00,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:00,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:00,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 01:44:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:00,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 01:44:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:00,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 01:44:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:00,732 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-22 01:44:00,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:44:00,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777035559] [2022-07-22 01:44:00,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777035559] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:44:00,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759519596] [2022-07-22 01:44:00,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:00,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:44:00,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:00,736 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-22 01:44:00,762 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-22 01:44:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:00,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 01:44:00,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:44:00,819 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-22 01:44:00,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 01:44:00,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759519596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:44:00,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 01:44:00,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-07-22 01:44:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514806899] [2022-07-22 01:44:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:44:00,821 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:44:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:44:00,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:44:00,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 01:44:00,822 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-22 01:44:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:44:00,859 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2022-07-22 01:44:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 01:44:00,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 103 transitions. [2022-07-22 01:44:00,863 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2022-07-22 01:44:00,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 103 transitions. [2022-07-22 01:44:00,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2022-07-22 01:44:00,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2022-07-22 01:44:00,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 103 transitions. [2022-07-22 01:44:00,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:44:00,876 INFO L369 hiAutomatonCegarLoop]: Abstraction has 81 states and 103 transitions. [2022-07-22 01:44:00,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 103 transitions. [2022-07-22 01:44:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2022-07-22 01:44:00,884 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-22 01:44:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2022-07-22 01:44:00,885 INFO L392 hiAutomatonCegarLoop]: Abstraction has 67 states and 83 transitions. [2022-07-22 01:44:00,885 INFO L374 stractBuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2022-07-22 01:44:00,885 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:44:00,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2022-07-22 01:44:00,886 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2022-07-22 01:44:00,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:44:00,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:44:00,887 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:44:00,887 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-22 01:44:00,887 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-22 01:44:00,888 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-22 01:44:00,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:00,888 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 3 times [2022-07-22 01:44:00,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:00,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11219592] [2022-07-22 01:44:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:00,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:00,917 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:00,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:00,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1032888824, now seen corresponding path program 1 times [2022-07-22 01:44:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:00,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230221937] [2022-07-22 01:44:00,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:00,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:00,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 01:44:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:01,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 01:44:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:01,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 01:44:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:01,042 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-22 01:44:01,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:44:01,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230221937] [2022-07-22 01:44:01,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230221937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:44:01,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700651693] [2022-07-22 01:44:01,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:01,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:44:01,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:01,044 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-22 01:44:01,045 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-22 01:44:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:01,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 01:44:01,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:44:01,183 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-22 01:44:01,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:44:01,290 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-22 01:44:01,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700651693] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:44:01,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:44:01,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-07-22 01:44:01,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207403199] [2022-07-22 01:44:01,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:44:01,291 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:44:01,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:44:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 01:44:01,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-22 01:44:01,292 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-22 01:44:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:44:01,609 INFO L93 Difference]: Finished difference Result 162 states and 216 transitions. [2022-07-22 01:44:01,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 01:44:01,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 216 transitions. [2022-07-22 01:44:01,616 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 89 [2022-07-22 01:44:01,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 216 transitions. [2022-07-22 01:44:01,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2022-07-22 01:44:01,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2022-07-22 01:44:01,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 216 transitions. [2022-07-22 01:44:01,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:44:01,622 INFO L369 hiAutomatonCegarLoop]: Abstraction has 162 states and 216 transitions. [2022-07-22 01:44:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 216 transitions. [2022-07-22 01:44:01,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 79. [2022-07-22 01:44:01,645 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-22 01:44:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2022-07-22 01:44:01,649 INFO L392 hiAutomatonCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-07-22 01:44:01,650 INFO L374 stractBuchiCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-07-22 01:44:01,650 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 01:44:01,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 97 transitions. [2022-07-22 01:44:01,651 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 36 [2022-07-22 01:44:01,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:44:01,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:44:01,655 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:44:01,656 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-22 01:44:01,656 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-22 01:44:01,656 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-22 01:44:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:01,657 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 4 times [2022-07-22 01:44:01,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:01,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994984256] [2022-07-22 01:44:01,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:01,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:01,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:01,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:01,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:01,693 INFO L85 PathProgramCache]: Analyzing trace with hash -245033989, now seen corresponding path program 1 times [2022-07-22 01:44:01,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:01,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878841014] [2022-07-22 01:44:01,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:01,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:01,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 01:44:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:01,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 01:44:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:01,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 01:44:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:01,794 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-22 01:44:01,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:44:01,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878841014] [2022-07-22 01:44:01,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878841014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:44:01,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:44:01,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 01:44:01,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761572203] [2022-07-22 01:44:01,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:44:01,797 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:44:01,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:44:01,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 01:44:01,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 01:44:01,798 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-22 01:44:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:44:01,859 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-07-22 01:44:01,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 01:44:01,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 121 transitions. [2022-07-22 01:44:01,864 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 49 [2022-07-22 01:44:01,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 97 states and 121 transitions. [2022-07-22 01:44:01,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2022-07-22 01:44:01,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2022-07-22 01:44:01,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 121 transitions. [2022-07-22 01:44:01,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:44:01,866 INFO L369 hiAutomatonCegarLoop]: Abstraction has 97 states and 121 transitions. [2022-07-22 01:44:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 121 transitions. [2022-07-22 01:44:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-07-22 01:44:01,876 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-22 01:44:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2022-07-22 01:44:01,878 INFO L392 hiAutomatonCegarLoop]: Abstraction has 93 states and 115 transitions. [2022-07-22 01:44:01,878 INFO L374 stractBuchiCegarLoop]: Abstraction has 93 states and 115 transitions. [2022-07-22 01:44:01,878 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 01:44:01,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 115 transitions. [2022-07-22 01:44:01,879 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2022-07-22 01:44:01,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:44:01,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:44:01,881 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:44:01,881 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-22 01:44:01,881 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-22 01:44:01,883 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-22 01:44:01,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:01,883 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 5 times [2022-07-22 01:44:01,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:01,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066824908] [2022-07-22 01:44:01,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:01,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:01,894 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:01,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:01,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash 357057537, now seen corresponding path program 1 times [2022-07-22 01:44:01,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:01,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045331200] [2022-07-22 01:44:01,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:01,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 01:44:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:01,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 01:44:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:01,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 01:44:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:01,976 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-22 01:44:01,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:44:01,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045331200] [2022-07-22 01:44:01,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045331200] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:44:01,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335542448] [2022-07-22 01:44:01,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:01,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:44:01,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:01,980 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-22 01:44:01,981 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-22 01:44:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:02,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:44:02,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:44:02,088 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-22 01:44:02,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:44:02,138 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-22 01:44:02,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335542448] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:44:02,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:44:02,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-07-22 01:44:02,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711849231] [2022-07-22 01:44:02,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:44:02,140 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:44:02,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:44:02,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 01:44:02,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-22 01:44:02,141 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-22 01:44:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:44:02,420 INFO L93 Difference]: Finished difference Result 183 states and 223 transitions. [2022-07-22 01:44:02,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 01:44:02,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 223 transitions. [2022-07-22 01:44:02,423 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 65 [2022-07-22 01:44:02,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 183 states and 223 transitions. [2022-07-22 01:44:02,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-07-22 01:44:02,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-07-22 01:44:02,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 223 transitions. [2022-07-22 01:44:02,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:44:02,426 INFO L369 hiAutomatonCegarLoop]: Abstraction has 183 states and 223 transitions. [2022-07-22 01:44:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 223 transitions. [2022-07-22 01:44:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2022-07-22 01:44:02,430 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-22 01:44:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2022-07-22 01:44:02,431 INFO L392 hiAutomatonCegarLoop]: Abstraction has 118 states and 142 transitions. [2022-07-22 01:44:02,431 INFO L374 stractBuchiCegarLoop]: Abstraction has 118 states and 142 transitions. [2022-07-22 01:44:02,431 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 01:44:02,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 142 transitions. [2022-07-22 01:44:02,432 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2022-07-22 01:44:02,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:44:02,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:44:02,434 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:44:02,434 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-22 01:44:02,434 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-22 01:44:02,434 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-22 01:44:02,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:02,435 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 6 times [2022-07-22 01:44:02,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:02,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173772396] [2022-07-22 01:44:02,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:02,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:02,443 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:02,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash 413165114, now seen corresponding path program 1 times [2022-07-22 01:44:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:02,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873182671] [2022-07-22 01:44:02,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:02,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:02,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 01:44:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:02,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 01:44:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:02,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 01:44:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:02,562 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-22 01:44:02,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:44:02,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873182671] [2022-07-22 01:44:02,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873182671] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:44:02,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983123191] [2022-07-22 01:44:02,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:02,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:44:02,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:02,596 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-22 01:44:02,598 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-22 01:44:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:02,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:44:02,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:44:02,734 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-22 01:44:02,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:44:02,795 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-22 01:44:02,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983123191] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:44:02,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:44:02,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2022-07-22 01:44:02,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221275429] [2022-07-22 01:44:02,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:44:02,797 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:44:02,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:44:02,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 01:44:02,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-22 01:44:02,798 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-22 01:44:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:44:03,086 INFO L93 Difference]: Finished difference Result 227 states and 287 transitions. [2022-07-22 01:44:03,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 01:44:03,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 287 transitions. [2022-07-22 01:44:03,089 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 113 [2022-07-22 01:44:03,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 227 states and 287 transitions. [2022-07-22 01:44:03,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2022-07-22 01:44:03,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 218 [2022-07-22 01:44:03,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 287 transitions. [2022-07-22 01:44:03,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:44:03,092 INFO L369 hiAutomatonCegarLoop]: Abstraction has 227 states and 287 transitions. [2022-07-22 01:44:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 287 transitions. [2022-07-22 01:44:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 120. [2022-07-22 01:44:03,097 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-22 01:44:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 144 transitions. [2022-07-22 01:44:03,098 INFO L392 hiAutomatonCegarLoop]: Abstraction has 120 states and 144 transitions. [2022-07-22 01:44:03,098 INFO L374 stractBuchiCegarLoop]: Abstraction has 120 states and 144 transitions. [2022-07-22 01:44:03,098 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 01:44:03,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 144 transitions. [2022-07-22 01:44:03,099 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2022-07-22 01:44:03,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:44:03,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:44:03,102 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:44:03,102 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-22 01:44:03,103 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-22 01:44:03,103 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-22 01:44:03,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:03,103 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 7 times [2022-07-22 01:44:03,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:03,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631821413] [2022-07-22 01:44:03,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:03,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:03,116 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:03,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:03,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:03,126 INFO L85 PathProgramCache]: Analyzing trace with hash -729143752, now seen corresponding path program 2 times [2022-07-22 01:44:03,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:03,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074811191] [2022-07-22 01:44:03,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:03,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:03,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:03,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:03,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:03,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1690449871, now seen corresponding path program 1 times [2022-07-22 01:44:03,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:03,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200121359] [2022-07-22 01:44:03,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:03,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:03,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 01:44:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 01:44:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 01:44:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 01:44:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:03,479 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-22 01:44:03,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:44:03,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200121359] [2022-07-22 01:44:03,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200121359] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:44:03,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379808795] [2022-07-22 01:44:03,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:03,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:44:03,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:03,482 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-22 01:44:03,491 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-22 01:44:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:03,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 01:44:03,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:44:03,703 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-22 01:44:03,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:44:03,968 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-22 01:44:03,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379808795] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:44:03,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:44:03,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 27 [2022-07-22 01:44:03,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983572388] [2022-07-22 01:44:03,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:44:07,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:44:07,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 01:44:07,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2022-07-22 01:44:07,923 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-22 01:44:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:44:08,661 INFO L93 Difference]: Finished difference Result 337 states and 420 transitions. [2022-07-22 01:44:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-22 01:44:08,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 420 transitions. [2022-07-22 01:44:08,666 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 141 [2022-07-22 01:44:08,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 333 states and 416 transitions. [2022-07-22 01:44:08,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2022-07-22 01:44:08,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2022-07-22 01:44:08,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 333 states and 416 transitions. [2022-07-22 01:44:08,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:44:08,672 INFO L369 hiAutomatonCegarLoop]: Abstraction has 333 states and 416 transitions. [2022-07-22 01:44:08,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states and 416 transitions. [2022-07-22 01:44:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 238. [2022-07-22 01:44:08,682 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-22 01:44:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 296 transitions. [2022-07-22 01:44:08,684 INFO L392 hiAutomatonCegarLoop]: Abstraction has 238 states and 296 transitions. [2022-07-22 01:44:08,684 INFO L374 stractBuchiCegarLoop]: Abstraction has 238 states and 296 transitions. [2022-07-22 01:44:08,684 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 01:44:08,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 238 states and 296 transitions. [2022-07-22 01:44:08,686 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 96 [2022-07-22 01:44:08,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:44:08,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:44:08,687 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:44:08,687 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:44:08,687 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-22 01:44:08,687 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-22 01:44:08,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash 313135262, now seen corresponding path program 2 times [2022-07-22 01:44:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:08,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787386772] [2022-07-22 01:44:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:08,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:08,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:08,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:08,707 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 4 times [2022-07-22 01:44:08,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:08,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136777531] [2022-07-22 01:44:08,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:08,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:08,711 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:08,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:08,717 INFO L85 PathProgramCache]: Analyzing trace with hash -56376460, now seen corresponding path program 3 times [2022-07-22 01:44:08,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:08,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818919856] [2022-07-22 01:44:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:08,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:08,753 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:08,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:09,665 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:44:09,665 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:44:09,665 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:44:09,665 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:44:09,666 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:44:09,666 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:09,666 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:44:09,666 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:44:09,666 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration12_Lasso [2022-07-22 01:44:09,666 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:44:09,666 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:44:09,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:09,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:10,102 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:44:10,103 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:44:10,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,106 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-22 01:44:10,107 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-22 01:44:10,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-22 01:44:10,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,141 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-22 01:44:10,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,145 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-22 01:44:10,146 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-22 01:44:10,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-22 01:44:10,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,188 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-22 01:44:10,189 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-22 01:44:10,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,212 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-22 01:44:10,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,214 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-22 01:44:10,215 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-22 01:44:10,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-22 01:44:10,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,239 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-22 01:44:10,240 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-22 01:44:10,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 01:44:10,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,272 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-22 01:44:10,273 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-22 01:44:10,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,296 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-22 01:44:10,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,298 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-22 01:44:10,303 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-22 01:44:10,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:44:10,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:44:10,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,328 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-22 01:44:10,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,329 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-22 01:44:10,332 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-22 01:44:10,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-22 01:44:10,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,355 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-22 01:44:10,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,357 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-22 01:44:10,357 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-22 01:44:10,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,381 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-22 01:44:10,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,383 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-22 01:44:10,383 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-22 01:44:10,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-22 01:44:10,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,410 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-22 01:44:10,410 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-22 01:44:10,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-22 01:44:10,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 01:44:10,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,441 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-22 01:44:10,441 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-22 01:44:10,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,486 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-22 01:44:10,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,488 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-22 01:44:10,488 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-22 01:44:10,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-22 01:44:10,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,514 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-22 01:44:10,515 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-22 01:44:10,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-22 01:44:10,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,540 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-22 01:44:10,541 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-22 01:44:10,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-22 01:44:10,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,566 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-22 01:44:10,567 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-22 01:44:10,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,591 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-22 01:44:10,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,592 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-22 01:44:10,593 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-22 01:44:10,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,618 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-22 01:44:10,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,619 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-22 01:44:10,620 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-22 01:44:10,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,644 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-22 01:44:10,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,652 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-22 01:44:10,653 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-22 01:44:10,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,676 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-22 01:44:10,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,678 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-22 01:44:10,678 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-22 01:44:10,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,704 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-22 01:44:10,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,705 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-22 01:44:10,707 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-22 01:44:10,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-07-22 01:44:10,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,731 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-22 01:44:10,732 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-22 01:44:10,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,758 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-22 01:44:10,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,759 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-22 01:44:10,760 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-22 01:44:10,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-22 01:44:10,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,792 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-22 01:44:10,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,805 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-22 01:44:10,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,847 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-22 01:44:10,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,849 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-22 01:44:10,850 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-22 01:44:10,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,873 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-22 01:44:10,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,875 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:44:10,875 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-22 01:44:10,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,900 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-22 01:44:10,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,901 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-22 01:44:10,902 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-22 01:44:10,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-22 01:44:10,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,928 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-22 01:44:10,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-22 01:44:10,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,952 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-22 01:44:10,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,953 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-22 01:44:10,954 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-22 01:44:10,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:10,979 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-22 01:44:10,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:10,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:10,980 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-22 01:44:10,981 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-22 01:44:10,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:10,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:10,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:10,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:10,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:10,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:10,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:10,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:10,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:11,005 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-22 01:44:11,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:11,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:11,006 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-22 01:44:11,007 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-22 01:44:11,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:11,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:11,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:11,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:11,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:11,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:11,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:11,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:11,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:11,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-22 01:44:11,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:11,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:11,033 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-22 01:44:11,034 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-22 01:44:11,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:11,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:11,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:11,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:11,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:11,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:44:11,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:44:11,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:11,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-07-22 01:44:11,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:11,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:11,066 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-22 01:44:11,069 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-22 01:44:11,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:11,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:11,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:11,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:11,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:11,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:11,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:11,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:11,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:11,099 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-22 01:44:11,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:11,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:11,100 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-22 01:44:11,101 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-22 01:44:11,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:11,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:11,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:11,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:11,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:11,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:11,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:11,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:11,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:11,125 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-22 01:44:11,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:11,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:11,127 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-22 01:44:11,127 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-22 01:44:11,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:11,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:11,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:44:11,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:11,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:11,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:11,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:44:11,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:44:11,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:44:11,151 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-22 01:44:11,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:11,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:11,152 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-22 01:44:11,153 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-22 01:44:11,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:44:11,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:44:11,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:44:11,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:44:11,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:44:11,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:44:11,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:44:11,179 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:44:11,191 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-22 01:44:11,191 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-22 01:44:11,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:11,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:11,192 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-22 01:44:11,193 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-22 01:44:11,194 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:44:11,200 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:44:11,201 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:44:11,201 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-22 01:44:11,217 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-22 01:44:11,219 INFO L293 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-07-22 01:44:11,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:11,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:44:11,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:44:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:11,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:44:11,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:44:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:44:11,365 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-22 01:44:11,365 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-22 01:44:11,449 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-22 01:44:11,451 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-22 01:44:11,452 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-22 01:44:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-07-22 01:44:11,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 3 letters. [2022-07-22 01:44:11,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:44:11,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 22 letters. Loop has 3 letters. [2022-07-22 01:44:11,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:44:11,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 6 letters. [2022-07-22 01:44:11,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:44:11,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 363 transitions. [2022-07-22 01:44:11,460 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 96 [2022-07-22 01:44:11,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 269 states and 348 transitions. [2022-07-22 01:44:11,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2022-07-22 01:44:11,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2022-07-22 01:44:11,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 269 states and 348 transitions. [2022-07-22 01:44:11,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:44:11,478 INFO L369 hiAutomatonCegarLoop]: Abstraction has 269 states and 348 transitions. [2022-07-22 01:44:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states and 348 transitions. [2022-07-22 01:44:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 259. [2022-07-22 01:44:11,487 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-22 01:44:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 331 transitions. [2022-07-22 01:44:11,490 INFO L392 hiAutomatonCegarLoop]: Abstraction has 259 states and 331 transitions. [2022-07-22 01:44:11,491 INFO L374 stractBuchiCegarLoop]: Abstraction has 259 states and 331 transitions. [2022-07-22 01:44:11,491 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 01:44:11,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 331 transitions. [2022-07-22 01:44:11,493 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 96 [2022-07-22 01:44:11,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:44:11,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:44:11,494 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-22 01:44:11,494 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 01:44:11,494 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-22 01:44:11,494 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-22 01:44:11,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1251148749, now seen corresponding path program 4 times [2022-07-22 01:44:11,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:11,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795503267] [2022-07-22 01:44:11,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:11,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:11,518 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:11,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:11,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1429943866, now seen corresponding path program 2 times [2022-07-22 01:44:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:11,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708111920] [2022-07-22 01:44:11,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:11,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:11,540 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:11,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:11,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:11,545 INFO L85 PathProgramCache]: Analyzing trace with hash 826925164, now seen corresponding path program 5 times [2022-07-22 01:44:11,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:11,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088076455] [2022-07-22 01:44:11,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:11,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:11,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-22 01:44:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 01:44:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:11,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 01:44:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:11,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 01:44:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:11,784 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-22 01:44:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:44:11,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088076455] [2022-07-22 01:44:11,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088076455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:44:11,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734434938] [2022-07-22 01:44:11,785 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 01:44:11,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:44:11,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:11,787 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-22 01:44:11,788 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-22 01:44:11,856 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 01:44:11,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:44:11,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 01:44:11,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:44:11,993 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-22 01:44:11,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:44:12,145 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-22 01:44:12,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734434938] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:44:12,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:44:12,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 24 [2022-07-22 01:44:12,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687990441] [2022-07-22 01:44:12,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:44:12,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:44:12,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 01:44:12,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-07-22 01:44:12,466 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-22 01:44:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:44:13,004 INFO L93 Difference]: Finished difference Result 651 states and 815 transitions. [2022-07-22 01:44:13,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 01:44:13,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 651 states and 815 transitions. [2022-07-22 01:44:13,014 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 293 [2022-07-22 01:44:13,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 651 states to 648 states and 812 transitions. [2022-07-22 01:44:13,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 618 [2022-07-22 01:44:13,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 629 [2022-07-22 01:44:13,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 648 states and 812 transitions. [2022-07-22 01:44:13,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:44:13,023 INFO L369 hiAutomatonCegarLoop]: Abstraction has 648 states and 812 transitions. [2022-07-22 01:44:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states and 812 transitions. [2022-07-22 01:44:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 357. [2022-07-22 01:44:13,036 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-22 01:44:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 453 transitions. [2022-07-22 01:44:13,039 INFO L392 hiAutomatonCegarLoop]: Abstraction has 357 states and 453 transitions. [2022-07-22 01:44:13,039 INFO L374 stractBuchiCegarLoop]: Abstraction has 357 states and 453 transitions. [2022-07-22 01:44:13,040 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-22 01:44:13,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 357 states and 453 transitions. [2022-07-22 01:44:13,042 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 139 [2022-07-22 01:44:13,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:44:13,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:44:13,044 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-22 01:44:13,045 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:44:13,045 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-22 01:44:13,045 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-22 01:44:13,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash 309875929, now seen corresponding path program 1 times [2022-07-22 01:44:13,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:13,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646761367] [2022-07-22 01:44:13,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:13,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:13,062 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:13,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:13,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times [2022-07-22 01:44:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:13,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935539100] [2022-07-22 01:44:13,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:13,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:13,095 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:13,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:13,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1231791987, now seen corresponding path program 2 times [2022-07-22 01:44:13,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:13,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332357769] [2022-07-22 01:44:13,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:13,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 01:44:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:13,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 01:44:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:13,205 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-22 01:44:13,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:44:13,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332357769] [2022-07-22 01:44:13,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332357769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:44:13,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939889345] [2022-07-22 01:44:13,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:44:13,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:44:13,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:13,208 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-22 01:44:13,209 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-22 01:44:13,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 01:44:13,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:44:13,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 01:44:13,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:44:13,380 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-22 01:44:13,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:44:13,433 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-22 01:44:13,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939889345] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:44:13,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:44:13,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-07-22 01:44:13,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714895685] [2022-07-22 01:44:13,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:44:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:44:13,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 01:44:13,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-07-22 01:44:13,608 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-22 01:44:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:44:13,823 INFO L93 Difference]: Finished difference Result 395 states and 495 transitions. [2022-07-22 01:44:13,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 01:44:13,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 395 states and 495 transitions. [2022-07-22 01:44:13,828 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 141 [2022-07-22 01:44:13,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 395 states to 395 states and 495 transitions. [2022-07-22 01:44:13,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2022-07-22 01:44:13,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 376 [2022-07-22 01:44:13,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 395 states and 495 transitions. [2022-07-22 01:44:13,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:44:13,833 INFO L369 hiAutomatonCegarLoop]: Abstraction has 395 states and 495 transitions. [2022-07-22 01:44:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states and 495 transitions. [2022-07-22 01:44:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 382. [2022-07-22 01:44:13,841 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-22 01:44:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 482 transitions. [2022-07-22 01:44:13,843 INFO L392 hiAutomatonCegarLoop]: Abstraction has 382 states and 482 transitions. [2022-07-22 01:44:13,843 INFO L374 stractBuchiCegarLoop]: Abstraction has 382 states and 482 transitions. [2022-07-22 01:44:13,843 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-22 01:44:13,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 382 states and 482 transitions. [2022-07-22 01:44:13,845 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 139 [2022-07-22 01:44:13,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:44:13,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:44:13,846 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-22 01:44:13,846 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:44:13,847 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-22 01:44:13,847 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-22 01:44:13,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2045280059, now seen corresponding path program 3 times [2022-07-22 01:44:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:13,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313199514] [2022-07-22 01:44:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:13,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 01:44:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:13,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 01:44:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:44:13,945 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-22 01:44:13,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:44:13,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313199514] [2022-07-22 01:44:13,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313199514] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:44:13,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183785033] [2022-07-22 01:44:13,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 01:44:13,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:44:13,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:44:13,951 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-22 01:44:13,972 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-22 01:44:14,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 01:44:14,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:44:14,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 01:44:14,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:44:14,111 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-22 01:44:14,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:44:14,195 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-22 01:44:14,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183785033] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:44:14,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:44:14,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 16 [2022-07-22 01:44:14,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328187011] [2022-07-22 01:44:14,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:44:14,195 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:44:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2022-07-22 01:44:14,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:14,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476004996] [2022-07-22 01:44:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:14,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:14,202 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:14,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:44:14,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 01:44:14,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-22 01:44:14,368 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-22 01:44:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:44:14,634 INFO L93 Difference]: Finished difference Result 562 states and 697 transitions. [2022-07-22 01:44:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 01:44:14,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 697 transitions. [2022-07-22 01:44:14,640 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 229 [2022-07-22 01:44:14,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 550 states and 685 transitions. [2022-07-22 01:44:14,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 529 [2022-07-22 01:44:14,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 529 [2022-07-22 01:44:14,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 550 states and 685 transitions. [2022-07-22 01:44:14,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:44:14,647 INFO L369 hiAutomatonCegarLoop]: Abstraction has 550 states and 685 transitions. [2022-07-22 01:44:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states and 685 transitions. [2022-07-22 01:44:14,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 386. [2022-07-22 01:44:14,658 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-22 01:44:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 489 transitions. [2022-07-22 01:44:14,660 INFO L392 hiAutomatonCegarLoop]: Abstraction has 386 states and 489 transitions. [2022-07-22 01:44:14,660 INFO L374 stractBuchiCegarLoop]: Abstraction has 386 states and 489 transitions. [2022-07-22 01:44:14,661 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-22 01:44:14,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 489 transitions. [2022-07-22 01:44:14,663 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 139 [2022-07-22 01:44:14,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:44:14,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:44:14,664 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-22 01:44:14,664 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:44:14,664 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-22 01:44:14,664 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-22 01:44:14,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:14,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2097782888, now seen corresponding path program 1 times [2022-07-22 01:44:14,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:14,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782934976] [2022-07-22 01:44:14,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:14,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:14,683 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:14,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:14,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:14,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2022-07-22 01:44:14,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:14,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532949529] [2022-07-22 01:44:14,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:14,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:14,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:14,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:44:14,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1629691942, now seen corresponding path program 1 times [2022-07-22 01:44:14,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:44:14,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358319381] [2022-07-22 01:44:14,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:44:14,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:44:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:14,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:44:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:44:14,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:44:17,082 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:44:17,082 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:44:17,082 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:44:17,082 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:44:17,083 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:44:17,083 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:44:17,083 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:44:17,083 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:44:17,083 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration16_Lasso [2022-07-22 01:44:17,083 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:44:17,083 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:44:17,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:44:17,354 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-22 01:44:17,361 INFO L158 Benchmark]: Toolchain (without parser) took 23153.07ms. Allocated memory was 54.5MB in the beginning and 151.0MB in the end (delta: 96.5MB). Free memory was 32.4MB in the beginning and 108.9MB in the end (delta: -76.5MB). Peak memory consumption was 98.3MB. Max. memory is 16.1GB. [2022-07-22 01:44:17,361 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 35.9MB in the end (delta: 29.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:44:17,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.96ms. Allocated memory is still 54.5MB. Free memory was 32.2MB in the beginning and 37.5MB in the end (delta: -5.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 01:44:17,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.71ms. Allocated memory is still 54.5MB. Free memory was 37.5MB in the beginning and 35.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:44:17,361 INFO L158 Benchmark]: Boogie Preprocessor took 47.42ms. Allocated memory is still 54.5MB. Free memory was 35.8MB in the beginning and 34.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:44:17,362 INFO L158 Benchmark]: RCFGBuilder took 367.19ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 34.4MB in the beginning and 48.1MB in the end (delta: -13.8MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2022-07-22 01:44:17,362 INFO L158 Benchmark]: BuchiAutomizer took 22383.60ms. Allocated memory was 67.1MB in the beginning and 151.0MB in the end (delta: 83.9MB). Free memory was 47.9MB in the beginning and 108.9MB in the end (delta: -61.0MB). Peak memory consumption was 101.9MB. Max. memory is 16.1GB. [2022-07-22 01:44:17,363 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.25ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 35.9MB in the end (delta: 29.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.96ms. Allocated memory is still 54.5MB. Free memory was 32.2MB in the beginning and 37.5MB in the end (delta: -5.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.71ms. Allocated memory is still 54.5MB. Free memory was 37.5MB in the beginning and 35.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.42ms. Allocated memory is still 54.5MB. Free memory was 35.8MB in the beginning and 34.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 367.19ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 34.4MB in the beginning and 48.1MB in the end (delta: -13.8MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 22383.60ms. Allocated memory was 67.1MB in the beginning and 151.0MB in the end (delta: 83.9MB). Free memory was 47.9MB in the beginning and 108.9MB in the end (delta: -61.0MB). Peak memory consumption was 101.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 01:44:17,385 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-22 01:44:17,588 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-22 01:44:17,788 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-22 01:44:17,988 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-22 01:44:18,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-07-22 01:44:18,389 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-22 01:44:18,589 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-22 01:44:18,789 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-22 01:44:18,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-07-22 01:44:19,190 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-22 01:44:19,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null