./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/bubble_sort-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/bubble_sort-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 121046493a5b65b32f3b8bf8adee655ff03b45acd38f0a8519ee3c99065fa840 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:24:53,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:24:53,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:24:53,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:24:53,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:24:53,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:24:53,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:24:53,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:24:53,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:24:53,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:24:53,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:24:53,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:24:53,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:24:53,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:24:53,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:24:53,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:24:53,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:24:53,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:24:53,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:24:53,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:24:53,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:24:53,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:24:53,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:24:53,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:24:53,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:24:53,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:24:53,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:24:53,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:24:53,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:24:53,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:24:53,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:24:53,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:24:53,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:24:53,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:24:53,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:24:53,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:24:53,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:24:53,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:24:53,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:24:53,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:24:53,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:24:53,355 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-14 23:24:53,376 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:24:53,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:24:53,377 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:24:53,377 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:24:53,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:24:53,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:24:53,378 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:24:53,379 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:24:53,379 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:24:53,379 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:24:53,380 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:24:53,380 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:24:53,380 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:24:53,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:24:53,381 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 23:24:53,381 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:24:53,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:24:53,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 23:24:53,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:24:53,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:24:53,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:24:53,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:24:53,382 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 23:24:53,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:24:53,382 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:24:53,383 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:24:53,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:24:53,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:24:53,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:24:53,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:24:53,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:24:53,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:24:53,385 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:24:53,385 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 121046493a5b65b32f3b8bf8adee655ff03b45acd38f0a8519ee3c99065fa840 [2021-12-14 23:24:53,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:24:53,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:24:53,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:24:53,617 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:24:53,618 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:24:53,619 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/bubble_sort-1.c [2021-12-14 23:24:53,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3445f21ab/bd65cea8d8f242b2a66701350439fab6/FLAG0b99eb96f [2021-12-14 23:24:54,083 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:24:54,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-1.c [2021-12-14 23:24:54,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3445f21ab/bd65cea8d8f242b2a66701350439fab6/FLAG0b99eb96f [2021-12-14 23:24:54,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3445f21ab/bd65cea8d8f242b2a66701350439fab6 [2021-12-14 23:24:54,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:24:54,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:24:54,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:24:54,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:24:54,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:24:54,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:24:54" (1/1) ... [2021-12-14 23:24:54,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44aea501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:54, skipping insertion in model container [2021-12-14 23:24:54,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:24:54" (1/1) ... [2021-12-14 23:24:54,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:24:54,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:24:54,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-1.c[325,338] [2021-12-14 23:24:54,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:24:54,721 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:24:54,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-1.c[325,338] [2021-12-14 23:24:54,760 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:24:54,775 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:24:54,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:54 WrapperNode [2021-12-14 23:24:54,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:24:54,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:24:54,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:24:54,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:24:54,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:54" (1/1) ... [2021-12-14 23:24:54,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:54" (1/1) ... [2021-12-14 23:24:54,834 INFO L137 Inliner]: procedures = 17, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2021-12-14 23:24:54,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:24:54,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:24:54,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:24:54,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:24:54,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:54" (1/1) ... [2021-12-14 23:24:54,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:54" (1/1) ... [2021-12-14 23:24:54,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:54" (1/1) ... [2021-12-14 23:24:54,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:54" (1/1) ... [2021-12-14 23:24:54,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:54" (1/1) ... [2021-12-14 23:24:54,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:54" (1/1) ... [2021-12-14 23:24:54,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:54" (1/1) ... [2021-12-14 23:24:54,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:24:54,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:24:54,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:24:54,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:24:54,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:54" (1/1) ... [2021-12-14 23:24:54,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:24:54,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:54,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:24:54,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-14 23:24:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 23:24:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 23:24:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 23:24:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 23:24:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:24:54,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:24:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 23:24:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 23:24:54,992 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:24:54,993 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:24:55,139 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:24:55,144 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:24:55,147 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-14 23:24:55,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:24:55 BoogieIcfgContainer [2021-12-14 23:24:55,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:24:55,164 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:24:55,164 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:24:55,167 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:24:55,168 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:24:55,168 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:24:54" (1/3) ... [2021-12-14 23:24:55,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62188996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:24:55, skipping insertion in model container [2021-12-14 23:24:55,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:24:55,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:54" (2/3) ... [2021-12-14 23:24:55,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62188996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:24:55, skipping insertion in model container [2021-12-14 23:24:55,170 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:24:55,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:24:55" (3/3) ... [2021-12-14 23:24:55,171 INFO L388 chiAutomizerObserver]: Analyzing ICFG bubble_sort-1.c [2021-12-14 23:24:55,235 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:24:55,236 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:24:55,236 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:24:55,237 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:24:55,237 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:24:55,238 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:24:55,238 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:24:55,238 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:24:55,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:55,285 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2021-12-14 23:24:55,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:24:55,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:24:55,291 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-14 23:24:55,292 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:24:55,292 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:24:55,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:55,297 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2021-12-14 23:24:55,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:24:55,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:24:55,298 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-14 23:24:55,298 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:24:55,303 INFO L791 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;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 6#L56true assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 27#L65true assume q1_#t~switch17#1;q1_~i~1#1 := 0; 11#L66-3true [2021-12-14 23:24:55,304 INFO L793 eck$LassoCheckResult]: Loop: 11#L66-3true assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 12#L66-2true q1_#t~pre18#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre18#1; 11#L66-3true [2021-12-14 23:24:55,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2021-12-14 23:24:55,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:55,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640184893] [2021-12-14 23:24:55,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:55,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:24:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:24:55,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:24:55,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640184893] [2021-12-14 23:24:55,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640184893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:24:55,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:24:55,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 23:24:55,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879117206] [2021-12-14 23:24:55,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:24:55,504 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:24:55,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2021-12-14 23:24:55,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:55,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564914567] [2021-12-14 23:24:55,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:55,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:55,526 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:55,555 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:24:55,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:24:55,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:24:55,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:24:55,668 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:24:55,690 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2021-12-14 23:24:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:24:55,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2021-12-14 23:24:55,710 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-14 23:24:55,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2021-12-14 23:24:55,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-14 23:24:55,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-14 23:24:55,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2021-12-14 23:24:55,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:24:55,717 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-12-14 23:24:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2021-12-14 23:24:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-12-14 23:24:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2021-12-14 23:24:55,759 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-12-14 23:24:55,759 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-12-14 23:24:55,759 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:24:55,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2021-12-14 23:24:55,759 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-14 23:24:55,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:24:55,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:24:55,760 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-14 23:24:55,760 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:24:55,760 INFO L791 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 61#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 64#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 65#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 77#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 76#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 71#L74-3 [2021-12-14 23:24:55,761 INFO L793 eck$LassoCheckResult]: Loop: 71#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 70#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 71#L74-3 [2021-12-14 23:24:55,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash 889584664, now seen corresponding path program 1 times [2021-12-14 23:24:55,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:55,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327532374] [2021-12-14 23:24:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:55,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:55,773 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:55,784 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:24:55,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2691, now seen corresponding path program 1 times [2021-12-14 23:24:55,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:55,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234343706] [2021-12-14 23:24:55,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:55,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:55,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:55,819 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:24:55,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:55,820 INFO L85 PathProgramCache]: Analyzing trace with hash 192371930, now seen corresponding path program 1 times [2021-12-14 23:24:55,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:55,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363673099] [2021-12-14 23:24:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:55,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:55,843 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:55,889 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:24:56,463 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:24:56,464 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:24:56,478 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:24:56,478 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:24:56,478 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:24:56,478 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:24:56,478 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:24:56,478 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:24:56,478 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration2_Lasso [2021-12-14 23:24:56,478 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:24:56,487 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:24:56,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:56,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:24:57,024 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:24:57,029 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:24:57,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:24:57,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:57,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:24:57,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:24:57,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:24:57,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:24:57,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:24:57,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:24:57,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:24:57,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-14 23:24:57,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:24:57,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:24:57,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:24:57,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-14 23:24:57,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:24:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:57,083 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:24:57,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-14 23:24:57,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:24:57,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:24:57,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:24:57,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:24:57,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:24:57,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:24:57,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:24:57,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:24:57,143 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 [2021-12-14 23:24:57,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:24:57,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:57,145 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:24:57,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-14 23:24:57,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:24:57,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:24:57,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:24:57,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:24:57,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:24:57,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:24:57,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:24:57,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:24:57,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-14 23:24:57,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:24:57,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:57,205 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:24:57,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-14 23:24:57,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:24:57,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:24:57,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:24:57,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:24:57,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:24:57,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:24:57,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:24:57,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:24:57,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-14 23:24:57,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:24:57,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:57,251 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:24:57,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-14 23:24:57,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:24:57,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:24:57,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:24:57,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:24:57,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:24:57,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:24:57,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:24:57,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:24:57,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-14 23:24:57,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:24:57,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:57,294 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:24:57,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-14 23:24:57,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:24:57,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:24:57,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:24:57,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:24:57,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:24:57,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:24:57,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:24:57,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:24:57,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-12-14 23:24:57,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:24:57,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:57,337 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:24:57,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-14 23:24:57,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:24:57,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:24:57,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:24:57,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:24:57,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:24:57,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:24:57,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:24:57,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:24:57,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-14 23:24:57,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:24:57,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:57,382 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:24:57,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-14 23:24:57,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:24:57,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:24:57,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:24:57,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:24:57,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:24:57,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:24:57,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:24:57,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:24:57,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-14 23:24:57,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:24:57,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:57,436 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) [2021-12-14 23:24:57,438 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 [2021-12-14 23:24:57,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:24:57,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:24:57,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:24:57,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:24:57,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:24:57,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:24:57,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:24:57,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:24:57,484 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 [2021-12-14 23:24:57,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:24:57,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:57,485 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:24:57,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-14 23:24:57,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:24:57,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:24:57,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:24:57,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:24:57,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:24:57,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:24:57,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:24:57,526 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:24:57,600 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-12-14 23:24:57,600 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-14 23:24:57,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:24:57,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:57,608 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:24:57,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-14 23:24:57,660 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:24:57,682 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-14 23:24:57,682 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:24:57,683 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_q1_~i~1#1, v_rep(select #length ULTIMATE.start_q1_~#a~1#1.base)_1) = -4*ULTIMATE.start_q1_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_q1_~#a~1#1.base)_1 Supporting invariants [1*ULTIMATE.start_q1_~#a~1#1.offset >= 0] [2021-12-14 23:24:57,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-14 23:24:57,719 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2021-12-14 23:24:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:24:57,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 23:24:57,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:24:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:24:57,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 23:24:57,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:24:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:24:57,834 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-14 23:24:57,835 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:57,878 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 28 states and 40 transitions. Complement of second has 8 states. [2021-12-14 23:24:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-14 23:24:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2021-12-14 23:24:57,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-14 23:24:57,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:24:57,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2021-12-14 23:24:57,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:24:57,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2021-12-14 23:24:57,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:24:57,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2021-12-14 23:24:57,887 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-12-14 23:24:57,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2021-12-14 23:24:57,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-14 23:24:57,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-14 23:24:57,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2021-12-14 23:24:57,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:24:57,889 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2021-12-14 23:24:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2021-12-14 23:24:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2021-12-14 23:24:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:57,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2021-12-14 23:24:57,891 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-14 23:24:57,891 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-14 23:24:57,891 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:24:57,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2021-12-14 23:24:57,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:24:57,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:24:57,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:24:57,892 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:24:57,892 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:24:57,893 INFO L791 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 193#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 194#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 207#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 205#L73 assume !q1_#t~switch17#1; 191#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 192#L18-3 [2021-12-14 23:24:57,893 INFO L793 eck$LassoCheckResult]: Loop: 192#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 203#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 202#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 192#L18-3 [2021-12-14 23:24:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:57,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 1 times [2021-12-14 23:24:57,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:57,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751700862] [2021-12-14 23:24:57,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:57,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:24:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:24:57,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:24:57,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751700862] [2021-12-14 23:24:57,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751700862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:24:57,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:24:57,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:24:57,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253097611] [2021-12-14 23:24:57,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:24:57,912 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:24:57,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:57,913 INFO L85 PathProgramCache]: Analyzing trace with hash 114407, now seen corresponding path program 1 times [2021-12-14 23:24:57,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:57,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139151980] [2021-12-14 23:24:57,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:57,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:24:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:24:57,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:24:57,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139151980] [2021-12-14 23:24:57,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139151980] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:24:57,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:24:57,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 23:24:57,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910971552] [2021-12-14 23:24:57,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:24:57,926 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:24:57,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:24:57,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:24:57,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:24:57,927 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:24:57,938 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2021-12-14 23:24:57,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:24:57,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2021-12-14 23:24:57,939 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:24:57,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2021-12-14 23:24:57,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-14 23:24:57,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-14 23:24:57,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2021-12-14 23:24:57,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:24:57,940 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-12-14 23:24:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2021-12-14 23:24:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-14 23:24:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2021-12-14 23:24:57,942 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-12-14 23:24:57,942 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-12-14 23:24:57,942 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:24:57,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2021-12-14 23:24:57,943 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:24:57,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:24:57,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:24:57,943 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:24:57,943 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-14 23:24:57,944 INFO L791 eck$LassoCheckResult]: Stem: 235#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 236#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 239#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 240#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 254#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 252#L73 assume !q1_#t~switch17#1; 237#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 238#L18-3 [2021-12-14 23:24:57,944 INFO L793 eck$LassoCheckResult]: Loop: 238#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 249#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 250#L23 assume !(bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1); 244#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 251#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 248#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 238#L18-3 [2021-12-14 23:24:57,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 2 times [2021-12-14 23:24:57,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:57,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023904907] [2021-12-14 23:24:57,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:57,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:24:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:24:57,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:24:57,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023904907] [2021-12-14 23:24:57,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023904907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:24:57,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:24:57,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:24:57,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750448816] [2021-12-14 23:24:57,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:24:57,961 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:24:57,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:57,962 INFO L85 PathProgramCache]: Analyzing trace with hash -884895266, now seen corresponding path program 1 times [2021-12-14 23:24:57,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:57,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112425528] [2021-12-14 23:24:57,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:57,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:24:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:24:57,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:24:57,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112425528] [2021-12-14 23:24:57,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112425528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:24:57,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:24:57,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 23:24:57,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949521340] [2021-12-14 23:24:57,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:24:57,974 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:24:57,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:24:57,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:24:57,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:24:57,975 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:24:57,984 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2021-12-14 23:24:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:24:57,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2021-12-14 23:24:57,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:24:57,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2021-12-14 23:24:57,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-14 23:24:57,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-14 23:24:57,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2021-12-14 23:24:57,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:24:57,986 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-14 23:24:57,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2021-12-14 23:24:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-12-14 23:24:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2021-12-14 23:24:57,988 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-12-14 23:24:57,988 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-12-14 23:24:57,988 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:24:57,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2021-12-14 23:24:57,989 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:24:57,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:24:57,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:24:57,989 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:24:57,989 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:24:57,989 INFO L791 eck$LassoCheckResult]: Stem: 283#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 284#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 287#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 288#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 302#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 300#L73 assume !q1_#t~switch17#1; 285#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 286#L18-3 [2021-12-14 23:24:57,990 INFO L793 eck$LassoCheckResult]: Loop: 286#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 297#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 298#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 291#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 292#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 299#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 296#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 286#L18-3 [2021-12-14 23:24:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 3 times [2021-12-14 23:24:57,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:57,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264725101] [2021-12-14 23:24:57,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:57,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:24:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:24:58,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:24:58,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264725101] [2021-12-14 23:24:58,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264725101] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:24:58,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:24:58,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:24:58,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390250291] [2021-12-14 23:24:58,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:24:58,008 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:24:58,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:58,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 1 times [2021-12-14 23:24:58,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:58,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38187049] [2021-12-14 23:24:58,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:58,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:58,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:58,021 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:24:58,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:24:58,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:24:58,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:24:58,147 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:24:58,160 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2021-12-14 23:24:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:24:58,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2021-12-14 23:24:58,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:24:58,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2021-12-14 23:24:58,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-14 23:24:58,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-14 23:24:58,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2021-12-14 23:24:58,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:24:58,163 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-12-14 23:24:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2021-12-14 23:24:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-14 23:24:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2021-12-14 23:24:58,164 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-12-14 23:24:58,164 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-12-14 23:24:58,164 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:24:58,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2021-12-14 23:24:58,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:24:58,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:24:58,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:24:58,165 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:24:58,165 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:24:58,165 INFO L791 eck$LassoCheckResult]: Stem: 329#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 330#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 333#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 334#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 348#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 346#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 347#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 341#L74-4 q1_~i~1#1 := 0; 336#L76-3 [2021-12-14 23:24:58,165 INFO L793 eck$LassoCheckResult]: Loop: 336#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 335#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 336#L76-3 [2021-12-14 23:24:58,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:58,166 INFO L85 PathProgramCache]: Analyzing trace with hash 192371872, now seen corresponding path program 1 times [2021-12-14 23:24:58,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:58,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285620442] [2021-12-14 23:24:58,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:58,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:58,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:58,200 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:24:58,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:58,201 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2021-12-14 23:24:58,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:58,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163728644] [2021-12-14 23:24:58,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:58,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:58,206 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:24:58,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [914096728] [2021-12-14 23:24:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:58,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:24:58,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:58,212 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:24:58,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 23:24:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:58,242 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:58,249 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:24:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash 185777442, now seen corresponding path program 1 times [2021-12-14 23:24:58,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:58,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229697541] [2021-12-14 23:24:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:58,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:58,257 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:24:58,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106628358] [2021-12-14 23:24:58,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:58,257 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:24:58,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:58,259 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:24:58,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 23:24:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:24:58,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:24:58,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:24:58,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-14 23:24:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:24:58,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 23:24:58,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:24:58,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229697541] [2021-12-14 23:24:58,383 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 23:24:58,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106628358] [2021-12-14 23:24:58,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106628358] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:24:58,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:24:58,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 23:24:58,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616120693] [2021-12-14 23:24:58,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:24:58,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:24:58,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 23:24:58,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 23:24:58,537 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:24:58,589 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2021-12-14 23:24:58,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 23:24:58,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2021-12-14 23:24:58,593 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2021-12-14 23:24:58,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2021-12-14 23:24:58,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-12-14 23:24:58,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-12-14 23:24:58,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2021-12-14 23:24:58,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:24:58,594 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2021-12-14 23:24:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2021-12-14 23:24:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2021-12-14 23:24:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-12-14 23:24:58,596 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-14 23:24:58,596 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-14 23:24:58,596 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-14 23:24:58,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2021-12-14 23:24:58,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:24:58,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:24:58,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:24:58,597 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:24:58,597 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:24:58,597 INFO L791 eck$LassoCheckResult]: Stem: 431#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 435#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 436#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 451#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 449#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 450#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 443#L74-4 q1_~i~1#1 := 0; 444#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 433#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 434#L18-3 [2021-12-14 23:24:58,597 INFO L793 eck$LassoCheckResult]: Loop: 434#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 446#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 447#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 439#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 440#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 448#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 445#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 434#L18-3 [2021-12-14 23:24:58,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:58,598 INFO L85 PathProgramCache]: Analyzing trace with hash 185777387, now seen corresponding path program 1 times [2021-12-14 23:24:58,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:58,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708478124] [2021-12-14 23:24:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:58,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:58,615 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:58,626 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:24:58,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:58,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 2 times [2021-12-14 23:24:58,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:58,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574582941] [2021-12-14 23:24:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:58,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:58,648 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:58,655 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:24:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1443775097, now seen corresponding path program 1 times [2021-12-14 23:24:58,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:58,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664842769] [2021-12-14 23:24:58,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:58,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:24:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:24:58,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:24:58,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664842769] [2021-12-14 23:24:58,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664842769] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:24:58,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:24:58,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 23:24:58,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374002153] [2021-12-14 23:24:58,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:24:58,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:24:58,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 23:24:58,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 23:24:58,852 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:58,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:24:58,906 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-12-14 23:24:58,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 23:24:58,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2021-12-14 23:24:58,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:24:58,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 27 transitions. [2021-12-14 23:24:58,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-14 23:24:58,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-14 23:24:58,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2021-12-14 23:24:58,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:24:58,908 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-14 23:24:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2021-12-14 23:24:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2021-12-14 23:24:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-12-14 23:24:58,910 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-14 23:24:58,910 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-14 23:24:58,910 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-14 23:24:58,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2021-12-14 23:24:58,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:24:58,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:24:58,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:24:58,911 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:24:58,911 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:24:58,911 INFO L791 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 495#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 498#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 499#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 514#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 512#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 513#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 504#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 505#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 507#L74-4 q1_~i~1#1 := 0; 506#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 500#L76-2 [2021-12-14 23:24:58,911 INFO L793 eck$LassoCheckResult]: Loop: 500#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 501#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 500#L76-2 [2021-12-14 23:24:58,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:58,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1465845666, now seen corresponding path program 1 times [2021-12-14 23:24:58,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:58,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557546817] [2021-12-14 23:24:58,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:58,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:58,918 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:24:58,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1173398982] [2021-12-14 23:24:58,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:58,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:24:58,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:58,920 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:24:58,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 23:24:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:58,975 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:58,995 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:24:58,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:58,996 INFO L85 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 2 times [2021-12-14 23:24:58,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:58,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912694504] [2021-12-14 23:24:58,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:58,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:59,000 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:24:59,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11314650] [2021-12-14 23:24:59,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:24:59,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:24:59,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:59,004 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:24:59,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-14 23:24:59,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-14 23:24:59,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:24:59,048 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:59,055 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:24:59,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:59,056 INFO L85 PathProgramCache]: Analyzing trace with hash -71585824, now seen corresponding path program 1 times [2021-12-14 23:24:59,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:59,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040093660] [2021-12-14 23:24:59,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:59,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:59,064 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:24:59,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1317162920] [2021-12-14 23:24:59,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:59,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:24:59,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:59,066 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:24:59,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-14 23:24:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:24:59,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:24:59,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:24:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:24:59,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:24:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:24:59,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:24:59,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040093660] [2021-12-14 23:24:59,218 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 23:24:59,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317162920] [2021-12-14 23:24:59,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317162920] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:24:59,219 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 23:24:59,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-12-14 23:24:59,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174158308] [2021-12-14 23:24:59,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 23:24:59,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:24:59,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 23:24:59,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-14 23:24:59,365 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:24:59,441 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2021-12-14 23:24:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 23:24:59,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2021-12-14 23:24:59,443 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2021-12-14 23:24:59,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2021-12-14 23:24:59,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-12-14 23:24:59,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-12-14 23:24:59,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2021-12-14 23:24:59,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:24:59,444 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2021-12-14 23:24:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2021-12-14 23:24:59,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2021-12-14 23:24:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:24:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2021-12-14 23:24:59,447 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-14 23:24:59,447 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-14 23:24:59,447 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-14 23:24:59,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2021-12-14 23:24:59,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:24:59,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:24:59,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:24:59,448 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:24:59,448 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:24:59,448 INFO L791 eck$LassoCheckResult]: Stem: 654#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 655#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 658#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 659#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 675#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 673#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 674#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 664#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 665#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 676#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 680#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 679#L74-4 q1_~i~1#1 := 0; 668#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 660#L76-2 [2021-12-14 23:24:59,448 INFO L793 eck$LassoCheckResult]: Loop: 660#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 661#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 660#L76-2 [2021-12-14 23:24:59,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:59,448 INFO L85 PathProgramCache]: Analyzing trace with hash -69873632, now seen corresponding path program 2 times [2021-12-14 23:24:59,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:59,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145493273] [2021-12-14 23:24:59,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:59,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:59,456 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:24:59,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [191249009] [2021-12-14 23:24:59,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:24:59,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:24:59,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:59,464 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:24:59,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-14 23:24:59,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:24:59,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:24:59,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:59,534 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:24:59,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:59,534 INFO L85 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 3 times [2021-12-14 23:24:59,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:59,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594717090] [2021-12-14 23:24:59,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:59,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:59,537 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:24:59,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996942530] [2021-12-14 23:24:59,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 23:24:59,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:24:59,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:59,539 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:24:59,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-14 23:24:59,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-12-14 23:24:59,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:24:59,574 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:59,580 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:24:59,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:24:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1570918622, now seen corresponding path program 2 times [2021-12-14 23:24:59,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:24:59,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483473199] [2021-12-14 23:24:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:24:59,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:24:59,588 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:24:59,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [538051043] [2021-12-14 23:24:59,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:24:59,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:24:59,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:24:59,595 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:24:59,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-14 23:24:59,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:24:59,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:24:59,672 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:24:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:24:59,702 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:00,982 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:25:00,982 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:25:00,982 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:25:00,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:25:00,983 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:25:00,983 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:00,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:25:00,983 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:25:00,984 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration9_Lasso [2021-12-14 23:25:00,995 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:25:00,995 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:25:01,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:01,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:02,680 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:25:02,680 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:25:02,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:02,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:02,683 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:02,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-14 23:25:02,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:02,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:02,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:02,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:02,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:02,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:02,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:02,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:02,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2021-12-14 23:25:02,717 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:02,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:02,719 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:02,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-14 23:25:02,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:02,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:02,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:02,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:02,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:02,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:02,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:02,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:02,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:02,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-14 23:25:02,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:02,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:02,745 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:02,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-14 23:25:02,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:02,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:02,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:02,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:02,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:02,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:02,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:02,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:02,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:02,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:02,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:02,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:02,817 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:02,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-14 23:25:02,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:02,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:02,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:02,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:02,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:02,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:02,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:02,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:02,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:02,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:02,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:02,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:02,851 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:02,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-14 23:25:02,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:02,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:02,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:02,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:02,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:02,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:02,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:02,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:02,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:02,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:02,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:02,901 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:02,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-14 23:25:02,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:02,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:02,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:02,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:02,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:02,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:02,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:02,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:02,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:02,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:02,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:02,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:02,926 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:02,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-14 23:25:02,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:02,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:02,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:02,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:02,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:02,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:02,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:02,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:02,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:02,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:02,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:02,966 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:02,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-14 23:25:02,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:02,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:02,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:02,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:02,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:02,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:02,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:02,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:02,993 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 [2021-12-14 23:25:02,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:02,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:02,995 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:02,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-14 23:25:02,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:03,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:03,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:03,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:03,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:03,022 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 [2021-12-14 23:25:03,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,024 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-14 23:25:03,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:03,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:03,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:03,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:03,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:03,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-14 23:25:03,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,051 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-14 23:25:03,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:03,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:03,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:03,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:03,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:03,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-14 23:25:03,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,079 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-14 23:25:03,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:03,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:03,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:03,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:03,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:03,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-14 23:25:03,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,114 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-14 23:25:03,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:03,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:03,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:03,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:03,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:03,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-14 23:25:03,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,145 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-14 23:25:03,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:03,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:03,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:03,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:03,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:03,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-12-14 23:25:03,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,175 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-14 23:25:03,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:03,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:03,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:03,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:03,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:03,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-12-14 23:25:03,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,208 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-14 23:25:03,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:03,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:03,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:03,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:03,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:03,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-12-14 23:25:03,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,246 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-14 23:25:03,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:03,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:03,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:03,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:03,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:03,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:03,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,278 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-14 23:25:03,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:03,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:03,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:03,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:03,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:03,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:03,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,312 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-14 23:25:03,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:03,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:03,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:03,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:03,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:03,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:03,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,343 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-14 23:25:03,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:03,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:03,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:03,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:03,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:03,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:03,382 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 [2021-12-14 23:25:03,382 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,383 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-14 23:25:03,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:03,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:03,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:03,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:03,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:03,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:03,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,413 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-14 23:25:03,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:03,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:03,425 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-14 23:25:03,425 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2021-12-14 23:25:03,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:03,457 INFO L401 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2021-12-14 23:25:03,457 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2021-12-14 23:25:03,544 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:25:03,629 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-14 23:25:03,629 INFO L444 ModelExtractionUtils]: 26 out of 50 variables were initially zero. Simplification set additionally 21 variables to zero. [2021-12-14 23:25:03,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:03,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,635 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-14 23:25:03,676 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:25:03,686 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2021-12-14 23:25:03,686 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:25:03,686 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_q1_~#a~1#1.base)_2, ULTIMATE.start_q1_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_q1_~#a~1#1.base)_2 - 4*ULTIMATE.start_q1_~i~1#1 Supporting invariants [] [2021-12-14 23:25:03,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:03,729 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2021-12-14 23:25:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:03,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:25:03,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:03,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:25:03,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:25:03,844 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-14 23:25:03,844 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:03,894 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 38 states and 48 transitions. Complement of second has 5 states. [2021-12-14 23:25:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-14 23:25:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2021-12-14 23:25:03,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2021-12-14 23:25:03,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:03,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 15 letters. Loop has 2 letters. [2021-12-14 23:25:03,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:03,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 4 letters. [2021-12-14 23:25:03,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:03,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2021-12-14 23:25:03,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-14 23:25:03,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 35 transitions. [2021-12-14 23:25:03,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-14 23:25:03,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-12-14 23:25:03,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2021-12-14 23:25:03,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:25:03,900 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-12-14 23:25:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2021-12-14 23:25:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-12-14 23:25:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-14 23:25:03,908 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-14 23:25:03,908 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-14 23:25:03,908 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-14 23:25:03,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2021-12-14 23:25:03,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-14 23:25:03,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:03,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:03,910 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:03,910 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:03,911 INFO L791 eck$LassoCheckResult]: Stem: 831#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 832#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 835#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 836#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 853#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 851#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 852#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 854#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 855#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 845#L74-4 q1_~i~1#1 := 0; 846#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 837#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 838#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 833#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 834#L18-3 [2021-12-14 23:25:03,911 INFO L793 eck$LassoCheckResult]: Loop: 834#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 848#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 849#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 841#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 842#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 850#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 847#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 834#L18-3 [2021-12-14 23:25:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2075806767, now seen corresponding path program 1 times [2021-12-14 23:25:03,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:03,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071245895] [2021-12-14 23:25:03,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:03,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:03,918 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:03,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [741239716] [2021-12-14 23:25:03,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:03,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:03,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:03,920 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:03,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-12-14 23:25:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:03,966 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:03,984 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:03,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:03,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 3 times [2021-12-14 23:25:03,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:03,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496700871] [2021-12-14 23:25:03,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:03,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:03,990 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:03,995 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:03,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash -548718141, now seen corresponding path program 1 times [2021-12-14 23:25:03,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:03,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188417933] [2021-12-14 23:25:03,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:03,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:04,002 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:04,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258465243] [2021-12-14 23:25:04,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:04,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:04,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:04,005 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:04,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-12-14 23:25:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:04,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 23:25:04,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 23:25:04,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:25:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 23:25:04,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:25:04,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188417933] [2021-12-14 23:25:04,161 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 23:25:04,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258465243] [2021-12-14 23:25:04,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258465243] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:25:04,162 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 23:25:04,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-12-14 23:25:04,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278861472] [2021-12-14 23:25:04,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 23:25:04,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:25:04,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 23:25:04,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 23:25:04,273 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:25:04,327 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-12-14 23:25:04,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 23:25:04,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2021-12-14 23:25:04,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-14 23:25:04,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 33 transitions. [2021-12-14 23:25:04,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-14 23:25:04,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-14 23:25:04,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2021-12-14 23:25:04,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:25:04,329 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-14 23:25:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2021-12-14 23:25:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2021-12-14 23:25:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-12-14 23:25:04,331 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-12-14 23:25:04,331 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-12-14 23:25:04,331 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-14 23:25:04,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2021-12-14 23:25:04,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-14 23:25:04,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:04,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:04,332 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:04,332 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:04,332 INFO L791 eck$LassoCheckResult]: Stem: 1032#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1033#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 1036#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 1037#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 1054#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 1052#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 1053#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 1044#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 1045#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 1055#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 1056#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1046#L74-4 q1_~i~1#1 := 0; 1047#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 1038#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1039#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 1040#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1041#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1034#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 1035#L18-3 [2021-12-14 23:25:04,332 INFO L793 eck$LassoCheckResult]: Loop: 1035#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 1049#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1050#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1042#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1043#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 1051#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1048#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 1035#L18-3 [2021-12-14 23:25:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:04,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1273080179, now seen corresponding path program 2 times [2021-12-14 23:25:04,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:04,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096432252] [2021-12-14 23:25:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:04,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:04,339 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:04,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14809933] [2021-12-14 23:25:04,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:25:04,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:04,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:04,349 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:04,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-12-14 23:25:04,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:25:04,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:25:04,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:04,419 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:04,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 4 times [2021-12-14 23:25:04,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:04,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857834731] [2021-12-14 23:25:04,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:04,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:04,434 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:04,438 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:04,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1247881215, now seen corresponding path program 2 times [2021-12-14 23:25:04,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:04,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246364379] [2021-12-14 23:25:04,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:04,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:04,445 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:04,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047580369] [2021-12-14 23:25:04,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:25:04,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:04,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:04,447 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:04,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-12-14 23:25:04,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:25:04,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:25:04,509 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:04,534 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:04,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-14 23:25:07,519 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:25:07,519 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:25:07,519 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:25:07,519 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:25:07,519 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:25:07,519 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:07,520 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:25:07,520 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:25:07,520 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration11_Lasso [2021-12-14 23:25:07,520 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:25:07,520 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:25:07,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:07,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:08,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:08,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:08,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:08,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:08,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:09,242 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:25:09,243 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:25:09,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,256 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-14 23:25:09,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:09,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:09,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,285 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 [2021-12-14 23:25:09,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,286 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-14 23:25:09,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:09,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:09,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:09,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,311 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 [2021-12-14 23:25:09,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,312 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-14 23:25:09,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:09,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:09,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:09,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:09,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,341 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) [2021-12-14 23:25:09,341 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 [2021-12-14 23:25:09,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:09,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:09,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:09,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-14 23:25:09,367 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,368 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-14 23:25:09,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:09,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:09,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:09,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-14 23:25:09,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,394 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-14 23:25:09,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:09,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:09,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:09,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-12-14 23:25:09,419 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,420 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-14 23:25:09,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:09,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:09,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-12-14 23:25:09,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,450 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-14 23:25:09,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:09,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:09,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:09,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-12-14 23:25:09,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,476 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-14 23:25:09,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:09,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:09,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:09,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:09,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,501 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-14 23:25:09,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:09,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:09,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:09,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:09,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,534 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:09,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:09,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:09,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-14 23:25:09,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-12-14 23:25:09,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,582 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-14 23:25:09,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:09,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:09,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:09,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,606 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 [2021-12-14 23:25:09,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,607 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-14 23:25:09,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:09,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:09,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:09,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,653 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-14 23:25:09,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:09,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:09,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-12-14 23:25:09,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,683 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-14 23:25:09,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:09,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:09,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:09,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,706 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 [2021-12-14 23:25:09,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,708 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-14 23:25:09,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:09,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:09,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:09,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-12-14 23:25:09,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,733 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-12-14 23:25:09,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:09,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:09,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:09,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:09,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,758 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-12-14 23:25:09,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:09,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:09,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2021-12-14 23:25:09,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,795 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-12-14 23:25:09,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:09,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:09,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:09,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:09,821 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 [2021-12-14 23:25:09,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,822 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-12-14 23:25:09,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:09,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:09,830 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-14 23:25:09,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:09,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:09,841 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-14 23:25:09,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:09,854 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:25:09,877 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-12-14 23:25:09,877 INFO L444 ModelExtractionUtils]: 14 out of 37 variables were initially zero. Simplification set additionally 20 variables to zero. [2021-12-14 23:25:09,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:09,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:09,878 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:09,883 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:25:09,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-14 23:25:09,890 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:25:09,890 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:25:09,890 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubblesort_~a~0#1, ULTIMATE.start_bubblesort_~size#1) = -1*ULTIMATE.start_bubblesort_~a~0#1 + 1*ULTIMATE.start_bubblesort_~size#1 Supporting invariants [] [2021-12-14 23:25:09,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2021-12-14 23:25:09,953 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2021-12-14 23:25:09,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:09,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:25:09,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:10,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:25:10,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:25:10,080 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-14 23:25:10,080 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:10,097 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 32 states and 39 transitions. Complement of second has 4 states. [2021-12-14 23:25:10,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-14 23:25:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2021-12-14 23:25:10,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 7 letters. [2021-12-14 23:25:10,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:10,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 25 letters. Loop has 7 letters. [2021-12-14 23:25:10,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:10,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 14 letters. [2021-12-14 23:25:10,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:10,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2021-12-14 23:25:10,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:10,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 38 transitions. [2021-12-14 23:25:10,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-14 23:25:10,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-14 23:25:10,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2021-12-14 23:25:10,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:25:10,101 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-12-14 23:25:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2021-12-14 23:25:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-12-14 23:25:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-12-14 23:25:10,102 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-14 23:25:10,102 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-14 23:25:10,103 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-14 23:25:10,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2021-12-14 23:25:10,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:10,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:10,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:10,103 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:10,104 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:25:10,104 INFO L791 eck$LassoCheckResult]: Stem: 1268#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1269#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 1272#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 1273#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 1295#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 1293#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 1294#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 1282#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 1283#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 1296#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 1297#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1284#L74-4 q1_~i~1#1 := 0; 1285#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 1274#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1275#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 1276#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1277#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1270#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 1271#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 1289#L20-3 [2021-12-14 23:25:10,104 INFO L793 eck$LassoCheckResult]: Loop: 1289#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1290#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1278#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1279#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 1289#L20-3 [2021-12-14 23:25:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash 810779970, now seen corresponding path program 1 times [2021-12-14 23:25:10,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:10,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735051650] [2021-12-14 23:25:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:10,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:10,112 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:10,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141696772] [2021-12-14 23:25:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:10,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:10,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:10,114 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:10,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2021-12-14 23:25:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:10,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:10,189 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:10,190 INFO L85 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 1 times [2021-12-14 23:25:10,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:10,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406092275] [2021-12-14 23:25:10,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:10,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:10,196 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:10,200 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:10,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:10,200 INFO L85 PathProgramCache]: Analyzing trace with hash 618057612, now seen corresponding path program 1 times [2021-12-14 23:25:10,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:10,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145097367] [2021-12-14 23:25:10,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:10,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:10,207 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:10,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1172597650] [2021-12-14 23:25:10,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:10,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:10,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:10,214 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:10,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2021-12-14 23:25:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:10,288 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:10,318 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:11,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:13,582 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:25:13,582 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:25:13,582 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:25:13,582 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:25:13,582 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:25:13,582 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:13,582 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:25:13,582 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:25:13,582 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration12_Lasso [2021-12-14 23:25:13,582 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:25:13,582 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:25:13,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:13,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:13,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:13,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:13,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:13,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:13,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:13,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:13,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:13,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:13,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:13,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:15,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:15,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:15,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:15,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:15,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:15,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:15,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:15,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:15,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:15,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:15,906 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:25:15,906 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:25:15,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:15,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:15,912 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:15,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-12-14 23:25:15,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:15,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:15,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:15,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:15,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:15,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:15,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:15,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:15,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:15,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:15,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:15,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:15,969 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:15,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-12-14 23:25:15,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:15,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:15,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:15,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:15,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:15,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:15,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:15,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:15,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-12-14 23:25:16,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,001 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-12-14 23:25:16,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:16,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:16,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:16,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:16,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,027 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-12-14 23:25:16,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:16,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:16,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:16,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-12-14 23:25:16,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,051 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-12-14 23:25:16,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:16,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:16,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:16,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2021-12-14 23:25:16,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,077 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-12-14 23:25:16,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:16,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:16,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:16,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:16,102 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,103 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-12-14 23:25:16,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:16,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:16,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:16,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-12-14 23:25:16,128 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,129 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-12-14 23:25:16,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:16,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:16,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:16,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,156 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-12-14 23:25:16,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:16,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:16,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:16,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2021-12-14 23:25:16,187 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,188 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-12-14 23:25:16,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:16,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:16,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:16,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2021-12-14 23:25:16,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,213 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-12-14 23:25:16,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 [2021-12-14 23:25:16,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:16,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:16,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:16,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2021-12-14 23:25:16,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,240 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-12-14 23:25:16,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 [2021-12-14 23:25:16,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:16,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:16,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2021-12-14 23:25:16,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,270 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-12-14 23:25:16,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:16,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:16,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:16,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,298 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-12-14 23:25:16,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:16,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:16,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:16,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,326 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-12-14 23:25:16,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:16,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:16,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2021-12-14 23:25:16,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,384 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-12-14 23:25:16,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:16,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:16,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2021-12-14 23:25:16,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,412 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-12-14 23:25:16,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:16,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:16,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:16,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,440 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-12-14 23:25:16,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:16,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:16,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2021-12-14 23:25:16,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,470 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-12-14 23:25:16,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:16,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:16,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:16,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:16,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2021-12-14 23:25:16,499 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,503 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-12-14 23:25:16,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:16,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:16,513 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-14 23:25:16,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:16,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:16,522 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-14 23:25:16,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:16,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:25:16,562 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2021-12-14 23:25:16,563 INFO L444 ModelExtractionUtils]: 18 out of 40 variables were initially zero. Simplification set additionally 18 variables to zero. [2021-12-14 23:25:16,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:16,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,565 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-12-14 23:25:16,592 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:25:16,599 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:25:16,599 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:25:16,599 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubblesort_~a~0#1, ULTIMATE.start_bubblesort_~size#1, ULTIMATE.start_bubblesort_~b~0#1) = -3*ULTIMATE.start_bubblesort_~a~0#1 + 1*ULTIMATE.start_bubblesort_~size#1 + 2*ULTIMATE.start_bubblesort_~b~0#1 Supporting invariants [] [2021-12-14 23:25:16,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2021-12-14 23:25:16,692 INFO L297 tatePredicateManager]: 31 out of 31 supporting invariants were superfluous and have been removed [2021-12-14 23:25:16,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:16,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:25:16,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:16,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 23:25:16,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:25:16,800 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-14 23:25:16,800 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:16,819 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 65 transitions. Complement of second has 9 states. [2021-12-14 23:25:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-14 23:25:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2021-12-14 23:25:16,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2021-12-14 23:25:16,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:16,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 23 letters. Loop has 4 letters. [2021-12-14 23:25:16,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:16,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 19 letters. Loop has 8 letters. [2021-12-14 23:25:16,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:16,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2021-12-14 23:25:16,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:16,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 37 states and 46 transitions. [2021-12-14 23:25:16,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-14 23:25:16,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-14 23:25:16,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2021-12-14 23:25:16,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:25:16,822 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2021-12-14 23:25:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2021-12-14 23:25:16,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2021-12-14 23:25:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-12-14 23:25:16,825 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-12-14 23:25:16,825 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-12-14 23:25:16,825 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-14 23:25:16,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2021-12-14 23:25:16,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:16,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:16,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:16,826 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:16,826 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:25:16,826 INFO L791 eck$LassoCheckResult]: Stem: 1569#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1570#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 1573#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 1574#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 1596#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 1594#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 1595#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 1583#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 1584#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 1597#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 1598#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1585#L74-4 q1_~i~1#1 := 0; 1586#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 1575#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1576#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 1577#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1578#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1571#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 1572#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 1592#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1593#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1581#L25 assume !(bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1);havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1; 1582#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 1590#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1587#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 1588#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 1589#L20-3 [2021-12-14 23:25:16,826 INFO L793 eck$LassoCheckResult]: Loop: 1589#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1591#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1579#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1580#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 1589#L20-3 [2021-12-14 23:25:16,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:16,826 INFO L85 PathProgramCache]: Analyzing trace with hash 31459128, now seen corresponding path program 1 times [2021-12-14 23:25:16,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:16,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719423978] [2021-12-14 23:25:16,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:16,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:16,834 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:16,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1787822728] [2021-12-14 23:25:16,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:16,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:16,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:16,835 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:16,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2021-12-14 23:25:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:16,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 23:25:16,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:16,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 23:25:16,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:25:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 23:25:17,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:25:17,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719423978] [2021-12-14 23:25:17,037 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 23:25:17,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787822728] [2021-12-14 23:25:17,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787822728] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:25:17,038 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 23:25:17,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-12-14 23:25:17,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034756019] [2021-12-14 23:25:17,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 23:25:17,038 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:25:17,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:17,038 INFO L85 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 2 times [2021-12-14 23:25:17,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:17,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351193389] [2021-12-14 23:25:17,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:17,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:17,042 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:17,046 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:17,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:25:17,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 23:25:17,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-14 23:25:17,135 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 10 Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:25:17,248 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2021-12-14 23:25:17,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 23:25:17,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2021-12-14 23:25:17,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:17,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 37 states and 44 transitions. [2021-12-14 23:25:17,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-14 23:25:17,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-14 23:25:17,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2021-12-14 23:25:17,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:25:17,250 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2021-12-14 23:25:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2021-12-14 23:25:17,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2021-12-14 23:25:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-12-14 23:25:17,252 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-12-14 23:25:17,252 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-12-14 23:25:17,252 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-14 23:25:17,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2021-12-14 23:25:17,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:17,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:17,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:17,253 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:17,253 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:25:17,253 INFO L791 eck$LassoCheckResult]: Stem: 1826#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1827#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 1830#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 1831#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 1854#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 1852#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 1853#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 1840#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 1841#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 1859#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 1855#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 1856#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 1858#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1844#L74-4 q1_~i~1#1 := 0; 1842#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 1832#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1833#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 1834#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1835#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 1843#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1857#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1828#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 1829#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 1847#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1850#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1838#L25 assume !(bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1);havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1; 1839#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 1851#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1845#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 1846#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 1848#L20-3 [2021-12-14 23:25:17,261 INFO L793 eck$LassoCheckResult]: Loop: 1848#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1849#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1836#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1837#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 1848#L20-3 [2021-12-14 23:25:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:17,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1103015548, now seen corresponding path program 2 times [2021-12-14 23:25:17,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:17,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480746675] [2021-12-14 23:25:17,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:17,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:17,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:17,285 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:17,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [701348856] [2021-12-14 23:25:17,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:25:17,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:17,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:17,287 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:17,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2021-12-14 23:25:17,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:25:17,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:25:17,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 23:25:17,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 23:25:17,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:25:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 23:25:17,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:25:17,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480746675] [2021-12-14 23:25:17,519 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 23:25:17,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701348856] [2021-12-14 23:25:17,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701348856] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:25:17,520 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 23:25:17,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2021-12-14 23:25:17,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789646316] [2021-12-14 23:25:17,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 23:25:17,520 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:25:17,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:17,521 INFO L85 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 3 times [2021-12-14 23:25:17,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:17,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617425371] [2021-12-14 23:25:17,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:17,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:17,525 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:17,529 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:17,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:25:17,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 23:25:17,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-14 23:25:17,611 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. cyclomatic complexity: 10 Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:25:17,776 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2021-12-14 23:25:17,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 23:25:17,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2021-12-14 23:25:17,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:17,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 58 transitions. [2021-12-14 23:25:17,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-14 23:25:17,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-14 23:25:17,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 58 transitions. [2021-12-14 23:25:17,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:25:17,778 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 58 transitions. [2021-12-14 23:25:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 58 transitions. [2021-12-14 23:25:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2021-12-14 23:25:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2021-12-14 23:25:17,781 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-12-14 23:25:17,781 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-12-14 23:25:17,781 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-14 23:25:17,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2021-12-14 23:25:17,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:17,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:17,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:17,782 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:17,782 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:25:17,782 INFO L791 eck$LassoCheckResult]: Stem: 2113#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 2114#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 2117#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 2118#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 2141#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 2139#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 2140#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 2142#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 2143#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 2127#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 2128#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 2147#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 2146#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 2129#L74-4 q1_~i~1#1 := 0; 2130#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 2119#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 2120#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 2121#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 2122#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 2145#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 2144#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 2115#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 2116#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 2133#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 2150#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2125#L25 assume !(bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1);havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1; 2126#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 2134#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 2137#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2138#L25 assume !(bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1);havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1; 2149#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 2148#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 2131#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 2132#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 2135#L20-3 [2021-12-14 23:25:17,783 INFO L793 eck$LassoCheckResult]: Loop: 2135#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 2136#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2123#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2124#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 2135#L20-3 [2021-12-14 23:25:17,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:17,783 INFO L85 PathProgramCache]: Analyzing trace with hash 545700084, now seen corresponding path program 3 times [2021-12-14 23:25:17,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:17,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864211019] [2021-12-14 23:25:17,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:17,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:17,799 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:17,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533554967] [2021-12-14 23:25:17,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 23:25:17,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:17,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:17,801 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:17,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2021-12-14 23:25:17,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 23:25:17,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:25:17,896 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:17,939 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:17,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:17,940 INFO L85 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 4 times [2021-12-14 23:25:17,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:17,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562810246] [2021-12-14 23:25:17,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:17,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:17,944 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:17,948 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:17,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:17,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1677403586, now seen corresponding path program 1 times [2021-12-14 23:25:17,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:17,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850825540] [2021-12-14 23:25:17,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:17,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:17,959 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:17,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568952658] [2021-12-14 23:25:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:17,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:17,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:17,961 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:17,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2021-12-14 23:25:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:18,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-14 23:25:18,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:18,419 INFO L354 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2021-12-14 23:25:18,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 16 [2021-12-14 23:25:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:25:18,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:25:18,693 INFO L354 Elim1Store]: treesize reduction 81, result has 21.4 percent of original size [2021-12-14 23:25:18,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 28 [2021-12-14 23:25:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 23:25:18,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:25:18,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850825540] [2021-12-14 23:25:18,734 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 23:25:18,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568952658] [2021-12-14 23:25:18,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568952658] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:25:18,734 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 23:25:18,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7] total 19 [2021-12-14 23:25:18,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989235237] [2021-12-14 23:25:18,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 23:25:18,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:25:18,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 23:25:18,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2021-12-14 23:25:18,840 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. cyclomatic complexity: 11 Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:19,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:25:19,228 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2021-12-14 23:25:19,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 23:25:19,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 154 transitions. [2021-12-14 23:25:19,230 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-14 23:25:19,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 154 transitions. [2021-12-14 23:25:19,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2021-12-14 23:25:19,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2021-12-14 23:25:19,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 154 transitions. [2021-12-14 23:25:19,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:25:19,232 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 154 transitions. [2021-12-14 23:25:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 154 transitions. [2021-12-14 23:25:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 52. [2021-12-14 23:25:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2021-12-14 23:25:19,235 INFO L704 BuchiCegarLoop]: Abstraction has 52 states and 62 transitions. [2021-12-14 23:25:19,235 INFO L587 BuchiCegarLoop]: Abstraction has 52 states and 62 transitions. [2021-12-14 23:25:19,235 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-14 23:25:19,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 62 transitions. [2021-12-14 23:25:19,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:19,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:19,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:19,237 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:19,237 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:25:19,237 INFO L791 eck$LassoCheckResult]: Stem: 2546#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 2547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 2550#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 2551#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 2578#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 2576#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 2577#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 2561#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 2562#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 2583#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 2579#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 2580#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 2582#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 2563#L74-4 q1_~i~1#1 := 0; 2564#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 2552#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 2553#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 2554#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 2555#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 2565#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 2581#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 2548#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 2549#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 2568#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 2597#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2558#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2559#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 2596#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 2586#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2595#L25 assume !(bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1);havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1; 2590#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 2584#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 2585#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 2569#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 2571#L20-3 [2021-12-14 23:25:19,237 INFO L793 eck$LassoCheckResult]: Loop: 2571#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 2572#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2589#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2557#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 2571#L20-3 [2021-12-14 23:25:19,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:19,238 INFO L85 PathProgramCache]: Analyzing trace with hash -134358286, now seen corresponding path program 2 times [2021-12-14 23:25:19,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:19,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593373952] [2021-12-14 23:25:19,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:19,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:19,246 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:19,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108497509] [2021-12-14 23:25:19,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:25:19,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:19,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:19,255 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:19,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2021-12-14 23:25:19,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:25:19,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:25:19,341 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:19,386 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:19,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:19,386 INFO L85 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 5 times [2021-12-14 23:25:19,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:19,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771691168] [2021-12-14 23:25:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:19,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:19,392 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:19,401 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:19,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1090597572, now seen corresponding path program 3 times [2021-12-14 23:25:19,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:19,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461182669] [2021-12-14 23:25:19,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:19,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:19,411 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:19,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685784366] [2021-12-14 23:25:19,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 23:25:19,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:19,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:19,415 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:19,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2021-12-14 23:25:19,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 23:25:19,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:25:19,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 23:25:19,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:19,611 INFO L354 Elim1Store]: treesize reduction 57, result has 17.4 percent of original size [2021-12-14 23:25:19,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 33 [2021-12-14 23:25:19,739 INFO L354 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2021-12-14 23:25:19,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 16 [2021-12-14 23:25:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 23:25:19,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:25:19,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2021-12-14 23:25:19,941 INFO L354 Elim1Store]: treesize reduction 92, result has 13.2 percent of original size [2021-12-14 23:25:19,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2091 treesize of output 1855 [2021-12-14 23:25:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 23:25:20,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:25:20,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461182669] [2021-12-14 23:25:20,154 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 23:25:20,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685784366] [2021-12-14 23:25:20,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685784366] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:25:20,154 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 23:25:20,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-12-14 23:25:20,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775343212] [2021-12-14 23:25:20,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 23:25:20,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:25:20,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 23:25:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-14 23:25:20,248 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. cyclomatic complexity: 14 Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:25:20,380 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2021-12-14 23:25:20,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 23:25:20,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 94 transitions. [2021-12-14 23:25:20,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:25:20,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 94 transitions. [2021-12-14 23:25:20,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-12-14 23:25:20,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-12-14 23:25:20,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 94 transitions. [2021-12-14 23:25:20,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:25:20,382 INFO L681 BuchiCegarLoop]: Abstraction has 78 states and 94 transitions. [2021-12-14 23:25:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 94 transitions. [2021-12-14 23:25:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 53. [2021-12-14 23:25:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 52 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2021-12-14 23:25:20,385 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2021-12-14 23:25:20,385 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2021-12-14 23:25:20,385 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-14 23:25:20,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 64 transitions. [2021-12-14 23:25:20,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:20,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:20,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:20,386 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:20,386 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:25:20,386 INFO L791 eck$LassoCheckResult]: Stem: 2920#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 2921#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 2924#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 2925#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 2952#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 2950#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 2951#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 2953#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 2954#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 2934#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 2935#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 2958#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 2957#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 2936#L74-4 q1_~i~1#1 := 0; 2937#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 2926#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 2927#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 2928#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 2929#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 2956#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 2955#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 2922#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 2923#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 2940#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 2962#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2961#L25 assume !(bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1);havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1; 2947#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 2948#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 2960#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2969#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2968#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 2966#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 2965#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 2941#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 2943#L20-3 [2021-12-14 23:25:20,387 INFO L793 eck$LassoCheckResult]: Loop: 2943#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 2944#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2949#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 2931#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 2943#L20-3 [2021-12-14 23:25:20,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:20,387 INFO L85 PathProgramCache]: Analyzing trace with hash 543853042, now seen corresponding path program 4 times [2021-12-14 23:25:20,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:20,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748589479] [2021-12-14 23:25:20,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:20,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:20,395 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:20,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1875388997] [2021-12-14 23:25:20,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 23:25:20,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:20,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:20,407 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:20,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2021-12-14 23:25:20,534 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 23:25:20,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:25:20,534 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:20,581 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:20,581 INFO L85 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 6 times [2021-12-14 23:25:20,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:20,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165282229] [2021-12-14 23:25:20,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:20,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:20,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:20,605 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:20,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1937505340, now seen corresponding path program 5 times [2021-12-14 23:25:20,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:20,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848772610] [2021-12-14 23:25:20,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:20,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:20,614 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:25:20,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844935378] [2021-12-14 23:25:20,614 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 23:25:20,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:20,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:20,616 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:20,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2021-12-14 23:25:20,775 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-14 23:25:20,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:25:20,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:20,822 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:37,199 WARN L227 SmtUtils]: Spent 16.27s on a formula simplification. DAG size of input: 371 DAG size of output: 295 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)