./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 20ed64ec 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 0e1acfd31445967c69cca4f8260e477710826362 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 15:17:14,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 15:17:14,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 15:17:14,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 15:17:14,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 15:17:14,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 15:17:14,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 15:17:14,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 15:17:14,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 15:17:14,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 15:17:14,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 15:17:14,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 15:17:14,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 15:17:14,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 15:17:14,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 15:17:14,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 15:17:14,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 15:17:14,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 15:17:14,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 15:17:14,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 15:17:14,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 15:17:14,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 15:17:14,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 15:17:14,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 15:17:14,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 15:17:14,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 15:17:14,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 15:17:14,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 15:17:14,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 15:17:14,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 15:17:14,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 15:17:14,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 15:17:14,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 15:17:14,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 15:17:14,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 15:17:14,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 15:17:14,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 15:17:14,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 15:17:14,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 15:17:14,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 15:17:14,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 15:17:14,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 15:17:14,895 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 15:17:14,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 15:17:14,896 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 15:17:14,896 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 15:17:14,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 15:17:14,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 15:17:14,898 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 15:17:14,898 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 15:17:14,898 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 15:17:14,898 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 15:17:14,899 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 15:17:14,899 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 15:17:14,899 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 15:17:14,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 15:17:14,899 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 15:17:14,899 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 15:17:14,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 15:17:14,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 15:17:14,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 15:17:14,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 15:17:14,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 15:17:14,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 15:17:14,900 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 15:17:14,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 15:17:14,900 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 15:17:14,900 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 15:17:14,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 15:17:14,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 15:17:14,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 15:17:14,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 15:17:14,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 15:17:14,901 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 15:17:14,902 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 15:17:14,902 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 -> 0e1acfd31445967c69cca4f8260e477710826362 [2021-08-27 15:17:15,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 15:17:15,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 15:17:15,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 15:17:15,174 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 15:17:15,175 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 15:17:15,175 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-08-27 15:17:15,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec92250b3/8133fc26e0a04826b816698b185e19b7/FLAG077502537 [2021-08-27 15:17:15,597 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 15:17:15,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-1.c [2021-08-27 15:17:15,603 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec92250b3/8133fc26e0a04826b816698b185e19b7/FLAG077502537 [2021-08-27 15:17:15,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec92250b3/8133fc26e0a04826b816698b185e19b7 [2021-08-27 15:17:15,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 15:17:15,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 15:17:15,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 15:17:15,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 15:17:15,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 15:17:15,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:17:15" (1/1) ... [2021-08-27 15:17:15,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d299cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:15, skipping insertion in model container [2021-08-27 15:17:15,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:17:15" (1/1) ... [2021-08-27 15:17:15,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 15:17:15,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 15:17:15,752 WARN L228 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-08-27 15:17:15,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 15:17:15,795 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 15:17:15,805 WARN L228 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-08-27 15:17:15,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 15:17:15,863 INFO L208 MainTranslator]: Completed translation [2021-08-27 15:17:15,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:15 WrapperNode [2021-08-27 15:17:15,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 15:17:15,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 15:17:15,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 15:17:15,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 15:17:15,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:15" (1/1) ... [2021-08-27 15:17:15,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:15" (1/1) ... [2021-08-27 15:17:15,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 15:17:15,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 15:17:15,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 15:17:15,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 15:17:15,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:15" (1/1) ... [2021-08-27 15:17:15,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:15" (1/1) ... [2021-08-27 15:17:15,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:15" (1/1) ... [2021-08-27 15:17:15,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:15" (1/1) ... [2021-08-27 15:17:15,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:15" (1/1) ... [2021-08-27 15:17:15,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:15" (1/1) ... [2021-08-27 15:17:15,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:15" (1/1) ... [2021-08-27 15:17:15,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 15:17:15,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 15:17:15,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 15:17:15,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 15:17:15,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:15" (1/1) ... [2021-08-27 15:17:15,945 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:15,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:15,977 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-08-27 15:17:15,980 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-08-27 15:17:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 15:17:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 15:17:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 15:17:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 15:17:16,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 15:17:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 15:17:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 15:17:16,335 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 15:17:16,335 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2021-08-27 15:17:16,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:17:16 BoogieIcfgContainer [2021-08-27 15:17:16,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 15:17:16,337 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 15:17:16,337 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 15:17:16,339 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 15:17:16,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:17:16,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 03:17:15" (1/3) ... [2021-08-27 15:17:16,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53410a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 03:17:16, skipping insertion in model container [2021-08-27 15:17:16,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:17:16,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:15" (2/3) ... [2021-08-27 15:17:16,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53410a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 03:17:16, skipping insertion in model container [2021-08-27 15:17:16,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:17:16,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:17:16" (3/3) ... [2021-08-27 15:17:16,341 INFO L389 chiAutomizerObserver]: Analyzing ICFG bubble_sort-1.c [2021-08-27 15:17:16,369 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 15:17:16,370 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 15:17:16,370 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 15:17:16,370 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 15:17:16,370 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 15:17:16,370 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 15:17:16,370 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 15:17:16,370 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 15:17:16,379 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-08-27 15:17:16,390 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2021-08-27 15:17:16,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:16,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:16,393 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 15:17:16,393 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:17:16,393 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 15:17:16,394 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-08-27 15:17:16,395 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2021-08-27 15:17:16,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:16,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:16,395 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 15:17:16,395 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:17:16,400 INFO L791 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7#L-1true main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 6#L56true assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 27#L65true assume q1_#t~switch20;q1_~i~1 := 0; 11#L66-3true [2021-08-27 15:17:16,400 INFO L793 eck$LassoCheckResult]: Loop: 11#L66-3true assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 12#L66-2true q1_#t~pre21 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre21; 11#L66-3true [2021-08-27 15:17:16,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:16,403 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2021-08-27 15:17:16,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:16,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470402333] [2021-08-27 15:17:16,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:16,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:17:16,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:16,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470402333] [2021-08-27 15:17:16,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470402333] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:17:16,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:17:16,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 15:17:16,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768536606] [2021-08-27 15:17:16,535 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:17:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2021-08-27 15:17:16,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:16,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825370815] [2021-08-27 15:17:16,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:16,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:16,566 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:16,579 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:16,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:16,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 15:17:16,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 15:17:16,662 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-08-27 15:17:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:16,695 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2021-08-27 15:17:16,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 15:17:16,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2021-08-27 15:17:16,700 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 15:17:16,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2021-08-27 15:17:16,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-27 15:17:16,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-08-27 15:17:16,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2021-08-27 15:17:16,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:17:16,705 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-08-27 15:17:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2021-08-27 15:17:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-08-27 15:17:16,720 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-08-27 15:17:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2021-08-27 15:17:16,722 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-08-27 15:17:16,722 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-08-27 15:17:16,722 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 15:17:16,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2021-08-27 15:17:16,724 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 15:17:16,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:16,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:16,725 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 15:17:16,725 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:17:16,726 INFO L791 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 61#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 64#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 65#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 77#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 76#L73 assume q1_#t~switch20;q1_~i~1 := 0; 71#L74-3 [2021-08-27 15:17:16,726 INFO L793 eck$LassoCheckResult]: Loop: 71#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 70#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 71#L74-3 [2021-08-27 15:17:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash 889584664, now seen corresponding path program 1 times [2021-08-27 15:17:16,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:16,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986301484] [2021-08-27 15:17:16,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:16,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:16,750 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:16,774 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:16,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:16,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2691, now seen corresponding path program 1 times [2021-08-27 15:17:16,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:16,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745425542] [2021-08-27 15:17:16,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:16,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:16,787 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:16,791 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:16,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:16,792 INFO L82 PathProgramCache]: Analyzing trace with hash 192371930, now seen corresponding path program 1 times [2021-08-27 15:17:16,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:16,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129513117] [2021-08-27 15:17:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:16,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:16,804 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:16,818 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:17,528 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:17:17,529 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:17:17,529 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:17:17,529 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:17:17,529 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:17:17,529 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:17,529 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:17:17,529 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:17:17,529 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration2_Lasso [2021-08-27 15:17:17,529 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:17:17,530 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:17:17,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,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-08-27 15:17:17,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-08-27 15:17:17,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,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-08-27 15:17:17,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,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-08-27 15:17:17,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-08-27 15:17:17,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:17,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:18,011 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:17:18,013 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 15:17:18,014 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,029 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-08-27 15:17:18,043 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-08-27 15:17:18,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:18,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:18,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,092 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-08-27 15:17:18,092 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,093 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-08-27 15:17:18,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:18,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:18,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:18,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,120 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-08-27 15:17:18,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-08-27 15:17:18,129 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,130 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-08-27 15:17:18,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:18,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:18,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:18,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,156 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-08-27 15:17:18,161 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-08-27 15:17:18,161 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,162 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-08-27 15:17:18,163 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-08-27 15:17:18,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:18,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:18,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,203 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-08-27 15:17:18,204 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,205 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-08-27 15:17:18,212 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-08-27 15:17:18,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:18,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:18,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,252 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-08-27 15:17:18,253 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,254 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-08-27 15:17:18,277 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-08-27 15:17:18,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-08-27 15:17:18,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:18,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:18,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:18,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:18,326 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,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-08-27 15:17:18,337 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-08-27 15:17:18,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-08-27 15:17:18,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:18,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:18,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:18,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,368 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-08-27 15:17:18,369 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,370 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-08-27 15:17:18,371 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-08-27 15:17:18,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:18,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:18,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:18,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,432 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-08-27 15:17:18,432 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,433 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-08-27 15:17:18,434 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-08-27 15:17:18,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:18,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:18,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,471 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-08-27 15:17:18,471 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,472 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-08-27 15:17:18,473 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-08-27 15:17:18,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:18,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:18,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:18,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,512 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-08-27 15:17:18,513 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,514 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-08-27 15:17:18,515 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-08-27 15:17:18,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:18,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:18,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,557 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-08-27 15:17:18,557 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,563 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:18,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 15:17:18,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:18,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:18,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:18,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:18,603 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,604 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:18,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 15:17:18,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:18,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:18,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:18,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:18,641 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,641 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:18,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 15:17:18,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:18,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:18,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:18,685 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,685 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:18,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 15:17:18,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:18,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:18,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:18,728 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,729 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:18,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 15:17:18,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:18,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:18,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-08-27 15:17:18,763 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,764 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:18,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 15:17:18,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:18,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:18,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:18,853 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,854 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:18,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 15:17:18,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:18,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:18,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:18,885 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,886 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:18,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 15:17:18,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:18,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:18,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:18,933 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,933 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-08-27 15:17:18,934 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-08-27 15:17:18,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:18,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:18,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:18,962 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,963 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-08-27 15:17:18,963 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-08-27 15:17:18,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:18,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:18,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:18,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:18,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:18,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:18,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:18,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:18,991 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-08-27 15:17:18,992 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:18,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:18,993 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-08-27 15:17:18,994 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-08-27 15:17:18,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-08-27 15:17:19,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:19,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:19,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:19,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:19,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:19,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:19,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:19,036 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-08-27 15:17:19,037 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:19,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:19,037 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-08-27 15:17:19,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:19,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:19,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:19,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:19,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:19,071 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-08-27 15:17:19,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:19,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:19,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:19,106 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-08-27 15:17:19,106 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:19,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:19,114 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-08-27 15:17:19,114 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-08-27 15:17:19,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:19,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:19,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:19,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:19,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:19,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:19,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:19,144 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 15:17:19,171 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-08-27 15:17:19,171 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-08-27 15:17:19,173 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:19,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:19,174 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-08-27 15:17:19,174 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-08-27 15:17:19,175 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 15:17:19,197 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-08-27 15:17:19,197 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 15:17:19,198 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_q1_~i~1, v_rep(select #length ULTIMATE.start_q1_~#a~1.base)_1) = -4*ULTIMATE.start_q1_~i~1 + 1*v_rep(select #length ULTIMATE.start_q1_~#a~1.base)_1 Supporting invariants [1*ULTIMATE.start_q1_~#a~1.offset >= 0] [2021-08-27 15:17:19,215 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-08-27 15:17:19,238 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2021-08-27 15:17:19,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:19,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 15:17:19,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:19,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-08-27 15:17:19,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 15:17:19,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:17:19,404 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-08-27 15:17:19,405 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-08-27 15:17:19,441 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-08-27 15:17:19,442 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-08-27 15:17:19,442 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-08-27 15:17:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2021-08-27 15:17:19,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2021-08-27 15:17:19,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:19,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2021-08-27 15:17:19,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:19,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2021-08-27 15:17:19,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:19,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2021-08-27 15:17:19,445 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-08-27 15:17:19,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2021-08-27 15:17:19,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 15:17:19,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-08-27 15:17:19,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2021-08-27 15:17:19,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:17:19,446 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2021-08-27 15:17:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2021-08-27 15:17:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2021-08-27 15:17:19,447 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-08-27 15:17:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2021-08-27 15:17:19,447 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-08-27 15:17:19,448 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-08-27 15:17:19,448 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 15:17:19,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2021-08-27 15:17:19,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-08-27 15:17:19,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:19,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:19,448 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:19,448 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 15:17:19,448 INFO L791 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 210#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 213#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 214#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 227#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 225#L73 assume !q1_#t~switch20; 211#L63 havoc q1_#t~switch20;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem9, bubblesort_#t~mem10, bubblesort_#t~mem11, bubblesort_#t~mem12, bubblesort_#t~pre8, bubblesort_#t~pre7, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 212#L18-3 [2021-08-27 15:17:19,448 INFO L793 eck$LassoCheckResult]: Loop: 212#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 223#L20-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 222#L18-2 bubblesort_#t~pre7 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre7; 212#L18-3 [2021-08-27 15:17:19,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:19,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 1 times [2021-08-27 15:17:19,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:19,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754010656] [2021-08-27 15:17:19,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:19,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:17:19,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:19,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754010656] [2021-08-27 15:17:19,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754010656] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:17:19,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:17:19,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 15:17:19,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997309383] [2021-08-27 15:17:19,466 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:17:19,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:19,466 INFO L82 PathProgramCache]: Analyzing trace with hash 114407, now seen corresponding path program 1 times [2021-08-27 15:17:19,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:19,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761632657] [2021-08-27 15:17:19,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:19,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:17:19,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:19,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761632657] [2021-08-27 15:17:19,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761632657] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:17:19,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:17:19,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 15:17:19,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448646374] [2021-08-27 15:17:19,477 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 15:17:19,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:19,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 15:17:19,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 15:17:19,478 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-08-27 15:17:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:19,488 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2021-08-27 15:17:19,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 15:17:19,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2021-08-27 15:17:19,489 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-27 15:17:19,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2021-08-27 15:17:19,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-08-27 15:17:19,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-08-27 15:17:19,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2021-08-27 15:17:19,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:17:19,490 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-08-27 15:17:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2021-08-27 15:17:19,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-08-27 15:17:19,491 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-08-27 15:17:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2021-08-27 15:17:19,491 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-08-27 15:17:19,491 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-08-27 15:17:19,491 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 15:17:19,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2021-08-27 15:17:19,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-27 15:17:19,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:19,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:19,492 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:19,492 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-27 15:17:19,492 INFO L791 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 256#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 259#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 260#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 274#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 272#L73 assume !q1_#t~switch20; 257#L63 havoc q1_#t~switch20;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem9, bubblesort_#t~mem10, bubblesort_#t~mem11, bubblesort_#t~mem12, bubblesort_#t~pre8, bubblesort_#t~pre7, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 258#L18-3 [2021-08-27 15:17:19,492 INFO L793 eck$LassoCheckResult]: Loop: 258#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 269#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 270#L23 assume !(bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size); 264#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 271#L20-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 268#L18-2 bubblesort_#t~pre7 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre7; 258#L18-3 [2021-08-27 15:17:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 2 times [2021-08-27 15:17:19,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:19,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870430036] [2021-08-27 15:17:19,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:19,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:17:19,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:19,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870430036] [2021-08-27 15:17:19,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870430036] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:17:19,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:17:19,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 15:17:19,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491707058] [2021-08-27 15:17:19,508 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:17:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:19,508 INFO L82 PathProgramCache]: Analyzing trace with hash -884895266, now seen corresponding path program 1 times [2021-08-27 15:17:19,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:19,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474034288] [2021-08-27 15:17:19,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:19,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:17:19,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:19,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474034288] [2021-08-27 15:17:19,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474034288] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:17:19,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:17:19,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 15:17:19,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6285838] [2021-08-27 15:17:19,519 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 15:17:19,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:19,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 15:17:19,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 15:17:19,519 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-08-27 15:17:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:19,528 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2021-08-27 15:17:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 15:17:19,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2021-08-27 15:17:19,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-27 15:17:19,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2021-08-27 15:17:19,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-27 15:17:19,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-08-27 15:17:19,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2021-08-27 15:17:19,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:17:19,529 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-08-27 15:17:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2021-08-27 15:17:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-08-27 15:17:19,530 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-08-27 15:17:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2021-08-27 15:17:19,530 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-08-27 15:17:19,530 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-08-27 15:17:19,530 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 15:17:19,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2021-08-27 15:17:19,530 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-27 15:17:19,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:19,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:19,531 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:19,531 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:19,531 INFO L791 eck$LassoCheckResult]: Stem: 303#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 304#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 307#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 308#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 322#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 320#L73 assume !q1_#t~switch20; 305#L63 havoc q1_#t~switch20;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem9, bubblesort_#t~mem10, bubblesort_#t~mem11, bubblesort_#t~mem12, bubblesort_#t~pre8, bubblesort_#t~pre7, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 306#L18-3 [2021-08-27 15:17:19,531 INFO L793 eck$LassoCheckResult]: Loop: 306#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 317#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 318#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 311#L25 assume bubblesort_#t~mem9 > bubblesort_#t~mem10;havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10;call bubblesort_#t~mem11 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem11;havoc bubblesort_#t~mem11;call bubblesort_#t~mem12 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem12, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem12;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 312#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 319#L20-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 316#L18-2 bubblesort_#t~pre7 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre7; 306#L18-3 [2021-08-27 15:17:19,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:19,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 3 times [2021-08-27 15:17:19,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:19,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635043575] [2021-08-27 15:17:19,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:19,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:17:19,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:19,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635043575] [2021-08-27 15:17:19,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635043575] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:17:19,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:17:19,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 15:17:19,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049186694] [2021-08-27 15:17:19,557 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:17:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:19,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 1 times [2021-08-27 15:17:19,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:19,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973696813] [2021-08-27 15:17:19,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:19,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:19,562 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:19,567 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:19,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:19,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 15:17:19,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 15:17:19,687 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-08-27 15:17:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:19,694 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2021-08-27 15:17:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 15:17:19,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2021-08-27 15:17:19,694 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-27 15:17:19,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2021-08-27 15:17:19,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-08-27 15:17:19,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-08-27 15:17:19,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2021-08-27 15:17:19,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:17:19,695 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-08-27 15:17:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2021-08-27 15:17:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-08-27 15:17:19,696 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-08-27 15:17:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2021-08-27 15:17:19,696 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-08-27 15:17:19,696 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-08-27 15:17:19,696 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 15:17:19,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2021-08-27 15:17:19,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-27 15:17:19,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:19,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:19,696 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:19,696 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:17:19,697 INFO L791 eck$LassoCheckResult]: Stem: 349#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 350#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 353#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 354#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 368#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 366#L73 assume q1_#t~switch20;q1_~i~1 := 0; 367#L74-3 assume !(q1_~i~1 < q1_~N~0); 361#L74-4 q1_~i~1 := 0; 356#L76-3 [2021-08-27 15:17:19,697 INFO L793 eck$LassoCheckResult]: Loop: 356#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 355#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 356#L76-3 [2021-08-27 15:17:19,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:19,697 INFO L82 PathProgramCache]: Analyzing trace with hash 192371872, now seen corresponding path program 1 times [2021-08-27 15:17:19,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:19,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417690773] [2021-08-27 15:17:19,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:19,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:19,702 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:19,709 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:19,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:19,715 INFO L82 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2021-08-27 15:17:19,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:19,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820234272] [2021-08-27 15:17:19,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:19,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:19,718 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:19,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [114439750] [2021-08-27 15:17:19,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:19,718 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:19,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:19,733 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:19,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-08-27 15:17:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:19,844 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:19,854 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:19,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:19,854 INFO L82 PathProgramCache]: Analyzing trace with hash 185777442, now seen corresponding path program 1 times [2021-08-27 15:17:19,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:19,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310015563] [2021-08-27 15:17:19,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:19,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:19,859 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:19,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625576354] [2021-08-27 15:17:19,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:19,859 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:19,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:19,893 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:19,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-27 15:17:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:19,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:17:19,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:17:20,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:20,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310015563] [2021-08-27 15:17:20,026 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-27 15:17:20,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625576354] [2021-08-27 15:17:20,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625576354] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:17:20,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:17:20,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 15:17:20,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515543340] [2021-08-27 15:17:20,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:20,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 15:17:20,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 15:17:20,152 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-08-27 15:17:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:20,189 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2021-08-27 15:17:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 15:17:20,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2021-08-27 15:17:20,190 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2021-08-27 15:17:20,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2021-08-27 15:17:20,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-08-27 15:17:20,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-08-27 15:17:20,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2021-08-27 15:17:20,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:17:20,191 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2021-08-27 15:17:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2021-08-27 15:17:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2021-08-27 15:17:20,192 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-08-27 15:17:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-08-27 15:17:20,192 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-08-27 15:17:20,192 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-08-27 15:17:20,192 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 15:17:20,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2021-08-27 15:17:20,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-27 15:17:20,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:20,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:20,193 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:20,193 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:20,194 INFO L791 eck$LassoCheckResult]: Stem: 451#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 452#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 455#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 456#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 471#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 469#L73 assume q1_#t~switch20;q1_~i~1 := 0; 470#L74-3 assume !(q1_~i~1 < q1_~N~0); 463#L74-4 q1_~i~1 := 0; 464#L76-3 assume !(q1_~i~1 < q1_~N~0); 453#L63 havoc q1_#t~switch20;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem9, bubblesort_#t~mem10, bubblesort_#t~mem11, bubblesort_#t~mem12, bubblesort_#t~pre8, bubblesort_#t~pre7, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 454#L18-3 [2021-08-27 15:17:20,194 INFO L793 eck$LassoCheckResult]: Loop: 454#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 467#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 468#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 459#L25 assume bubblesort_#t~mem9 > bubblesort_#t~mem10;havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10;call bubblesort_#t~mem11 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem11;havoc bubblesort_#t~mem11;call bubblesort_#t~mem12 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem12, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem12;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 460#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 466#L20-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 465#L18-2 bubblesort_#t~pre7 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre7; 454#L18-3 [2021-08-27 15:17:20,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:20,194 INFO L82 PathProgramCache]: Analyzing trace with hash 185777387, now seen corresponding path program 1 times [2021-08-27 15:17:20,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:20,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977389299] [2021-08-27 15:17:20,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:20,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:20,200 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:20,206 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:20,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:20,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 2 times [2021-08-27 15:17:20,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:20,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292656284] [2021-08-27 15:17:20,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:20,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:20,211 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:20,215 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:20,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:20,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1443775097, now seen corresponding path program 1 times [2021-08-27 15:17:20,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:20,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86363760] [2021-08-27 15:17:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:20,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 15:17:20,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:20,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86363760] [2021-08-27 15:17:20,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86363760] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:17:20,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:17:20,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 15:17:20,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578791880] [2021-08-27 15:17:20,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:20,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 15:17:20,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 15:17:20,385 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-08-27 15:17:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:20,432 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-08-27 15:17:20,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 15:17:20,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2021-08-27 15:17:20,433 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-27 15:17:20,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 27 transitions. [2021-08-27 15:17:20,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 15:17:20,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 15:17:20,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2021-08-27 15:17:20,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:17:20,434 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-08-27 15:17:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2021-08-27 15:17:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2021-08-27 15:17:20,435 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-08-27 15:17:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-08-27 15:17:20,435 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-08-27 15:17:20,435 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-08-27 15:17:20,435 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 15:17:20,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2021-08-27 15:17:20,435 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-27 15:17:20,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:20,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:20,436 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:20,436 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:17:20,436 INFO L791 eck$LassoCheckResult]: Stem: 514#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 515#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 518#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 519#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 534#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 532#L73 assume q1_#t~switch20;q1_~i~1 := 0; 533#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 524#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 525#L74-3 assume !(q1_~i~1 < q1_~N~0); 526#L74-4 q1_~i~1 := 0; 527#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 520#L76-2 [2021-08-27 15:17:20,436 INFO L793 eck$LassoCheckResult]: Loop: 520#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 521#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 520#L76-2 [2021-08-27 15:17:20,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:20,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1465845666, now seen corresponding path program 1 times [2021-08-27 15:17:20,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:20,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877657398] [2021-08-27 15:17:20,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:20,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:20,442 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:20,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604175778] [2021-08-27 15:17:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:20,442 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:20,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:20,469 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:20,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-08-27 15:17:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:20,527 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:20,550 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:20,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:20,551 INFO L82 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 2 times [2021-08-27 15:17:20,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:20,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852226004] [2021-08-27 15:17:20,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:20,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:20,553 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:20,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985130660] [2021-08-27 15:17:20,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 15:17:20,554 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:20,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:20,555 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:20,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-08-27 15:17:20,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-27 15:17:20,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-08-27 15:17:20,599 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:20,607 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:20,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:20,608 INFO L82 PathProgramCache]: Analyzing trace with hash -71585824, now seen corresponding path program 1 times [2021-08-27 15:17:20,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:20,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816922138] [2021-08-27 15:17:20,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:20,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:20,613 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:20,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [679699241] [2021-08-27 15:17:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:20,613 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:20,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:20,614 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:20,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-08-27 15:17:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:20,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 15:17:20,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:17:20,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:20,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816922138] [2021-08-27 15:17:20,808 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-27 15:17:20,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679699241] [2021-08-27 15:17:20,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679699241] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:17:20,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 15:17:20,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-08-27 15:17:20,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478890087] [2021-08-27 15:17:20,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:20,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 15:17:20,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 15:17:20,941 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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-08-27 15:17:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:21,002 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2021-08-27 15:17:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 15:17:21,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2021-08-27 15:17:21,003 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2021-08-27 15:17:21,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2021-08-27 15:17:21,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-08-27 15:17:21,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-08-27 15:17:21,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2021-08-27 15:17:21,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:17:21,004 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2021-08-27 15:17:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2021-08-27 15:17:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2021-08-27 15:17:21,005 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-08-27 15:17:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2021-08-27 15:17:21,006 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-08-27 15:17:21,006 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-08-27 15:17:21,006 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 15:17:21,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2021-08-27 15:17:21,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-27 15:17:21,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:21,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:21,007 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:21,007 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:17:21,007 INFO L791 eck$LassoCheckResult]: Stem: 636#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 637#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 640#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 641#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 657#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 655#L73 assume q1_#t~switch20;q1_~i~1 := 0; 656#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 646#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 647#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 658#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 662#L74-3 assume !(q1_~i~1 < q1_~N~0); 661#L74-4 q1_~i~1 := 0; 650#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 642#L76-2 [2021-08-27 15:17:21,007 INFO L793 eck$LassoCheckResult]: Loop: 642#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 643#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 642#L76-2 [2021-08-27 15:17:21,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:21,008 INFO L82 PathProgramCache]: Analyzing trace with hash -69873632, now seen corresponding path program 2 times [2021-08-27 15:17:21,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:21,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415361923] [2021-08-27 15:17:21,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:21,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:21,013 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:21,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358113806] [2021-08-27 15:17:21,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 15:17:21,013 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:21,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:21,043 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:21,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-08-27 15:17:21,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 15:17:21,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-08-27 15:17:21,172 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:21,192 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:21,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 3 times [2021-08-27 15:17:21,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:21,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50508145] [2021-08-27 15:17:21,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:21,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:21,195 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:21,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1075578016] [2021-08-27 15:17:21,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 15:17:21,195 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:21,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:21,228 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:21,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-08-27 15:17:21,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-08-27 15:17:21,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-08-27 15:17:21,321 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:21,328 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:21,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1570918622, now seen corresponding path program 2 times [2021-08-27 15:17:21,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:21,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967714438] [2021-08-27 15:17:21,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:21,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:21,334 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:21,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1809458638] [2021-08-27 15:17:21,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 15:17:21,334 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:21,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:21,361 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:21,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-08-27 15:17:21,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 15:17:21,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-08-27 15:17:21,461 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:21,485 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:23,364 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:17:23,365 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:17:23,365 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:17:23,365 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:17:23,365 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:17:23,365 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:23,365 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:17:23,365 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:17:23,365 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration9_Lasso [2021-08-27 15:17:23,365 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:17:23,366 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:17:23,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:23,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:25,138 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:17:25,138 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 15:17:25,138 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:25,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:25,139 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-08-27 15:17:25,140 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-08-27 15:17:25,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:25,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:25,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:25,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:25,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:25,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:25,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:25,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:25,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:25,183 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:25,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:25,183 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-08-27 15:17:25,184 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-08-27 15:17:25,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:25,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:25,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:25,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:25,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:25,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:25,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:25,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:25,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:25,228 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:25,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:25,229 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-08-27 15:17:25,230 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-08-27 15:17:25,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:25,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:25,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:25,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:25,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:25,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:25,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:25,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:25,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:25,271 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-08-27 15:17:25,271 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:25,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:25,272 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-08-27 15:17:25,273 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-08-27 15:17:25,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:25,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:25,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:25,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:25,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:25,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:25,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:25,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:25,314 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-08-27 15:17:25,315 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:25,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:25,316 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-08-27 15:17:25,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-08-27 15:17:25,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:25,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:25,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:25,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:25,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:25,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:25,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:25,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:25,359 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-08-27 15:17:25,360 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:25,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:25,360 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-08-27 15:17:25,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:25,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:25,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:25,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:25,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:25,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:25,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:25,376 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-08-27 15:17:25,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:25,402 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-08-27 15:17:25,403 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:25,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:25,404 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-08-27 15:17:25,404 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-08-27 15:17:25,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:25,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:25,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:25,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:25,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:25,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:25,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:25,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:25,444 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-08-27 15:17:25,445 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:25,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:25,446 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-08-27 15:17:25,446 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-08-27 15:17:25,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:25,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:25,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:25,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:25,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:25,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:25,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:25,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:25,476 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-08-27 15:17:25,476 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:25,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:25,477 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-08-27 15:17:25,478 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-08-27 15:17:25,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:25,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:25,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:25,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:25,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:25,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:25,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:25,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:25,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:25,533 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:25,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:25,545 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:25,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-08-27 15:17:25,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:25,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:25,555 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-08-27 15:17:25,555 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2021-08-27 15:17:25,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:25,589 INFO L401 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2021-08-27 15:17:25,590 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2021-08-27 15:17:25,651 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 15:17:25,723 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2021-08-27 15:17:25,723 INFO L444 ModelExtractionUtils]: 39 out of 57 variables were initially zero. Simplification set additionally 15 variables to zero. [2021-08-27 15:17:25,723 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:25,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:25,725 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:25,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-08-27 15:17:25,726 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 15:17:25,746 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2021-08-27 15:17:25,746 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 15:17:25,746 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_q1_~N~0, ULTIMATE.start_q1_~i~1) = 1*ULTIMATE.start_q1_~N~0 - 1*ULTIMATE.start_q1_~i~1 Supporting invariants [] [2021-08-27 15:17:25,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:25,798 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2021-08-27 15:17:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:25,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 15:17:25,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:25,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:17:25,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:17:25,919 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-08-27 15:17:25,919 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-08-27 15:17:25,958 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 4 states. [2021-08-27 15:17:25,959 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-08-27 15:17:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-08-27 15:17:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2021-08-27 15:17:25,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2021-08-27 15:17:25,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:25,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 15 letters. Loop has 2 letters. [2021-08-27 15:17:25,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:25,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 4 letters. [2021-08-27 15:17:25,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:25,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2021-08-27 15:17:25,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-08-27 15:17:25,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 35 transitions. [2021-08-27 15:17:25,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-08-27 15:17:25,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 15:17:25,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2021-08-27 15:17:25,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:17:25,962 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-08-27 15:17:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2021-08-27 15:17:25,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-08-27 15:17:25,963 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-08-27 15:17:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-08-27 15:17:25,963 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-08-27 15:17:25,963 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-08-27 15:17:25,963 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 15:17:25,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2021-08-27 15:17:25,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-08-27 15:17:25,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:25,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:25,964 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:25,964 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:25,965 INFO L791 eck$LassoCheckResult]: Stem: 814#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 815#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 818#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 819#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 836#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 834#L73 assume q1_#t~switch20;q1_~i~1 := 0; 835#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 837#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 838#L74-3 assume !(q1_~i~1 < q1_~N~0); 828#L74-4 q1_~i~1 := 0; 829#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 820#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 821#L76-3 assume !(q1_~i~1 < q1_~N~0); 816#L63 havoc q1_#t~switch20;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem9, bubblesort_#t~mem10, bubblesort_#t~mem11, bubblesort_#t~mem12, bubblesort_#t~pre8, bubblesort_#t~pre7, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 817#L18-3 [2021-08-27 15:17:25,965 INFO L793 eck$LassoCheckResult]: Loop: 817#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 831#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 832#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 824#L25 assume bubblesort_#t~mem9 > bubblesort_#t~mem10;havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10;call bubblesort_#t~mem11 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem11;havoc bubblesort_#t~mem11;call bubblesort_#t~mem12 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem12, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem12;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 825#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 833#L20-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 830#L18-2 bubblesort_#t~pre7 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre7; 817#L18-3 [2021-08-27 15:17:25,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:25,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2075806767, now seen corresponding path program 1 times [2021-08-27 15:17:25,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:25,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306672514] [2021-08-27 15:17:25,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:25,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:25,970 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:25,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923576673] [2021-08-27 15:17:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:25,970 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:25,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:25,971 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-08-27 15:17:25,978 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-08-27 15:17:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:26,064 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:26,126 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:26,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 3 times [2021-08-27 15:17:26,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:26,127 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182134342] [2021-08-27 15:17:26,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:26,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:26,132 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:26,136 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:26,136 INFO L82 PathProgramCache]: Analyzing trace with hash -548718141, now seen corresponding path program 1 times [2021-08-27 15:17:26,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:26,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917983862] [2021-08-27 15:17:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:26,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:26,140 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:26,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2143137201] [2021-08-27 15:17:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:26,141 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:26,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:26,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-08-27 15:17:26,144 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-08-27 15:17:26,169 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-08-27 15:17:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:26,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 15:17:26,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 15:17:26,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:26,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917983862] [2021-08-27 15:17:26,301 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-27 15:17:26,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143137201] [2021-08-27 15:17:26,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143137201] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:17:26,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 15:17:26,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-08-27 15:17:26,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221404487] [2021-08-27 15:17:26,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:26,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 15:17:26,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 15:17:26,456 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-08-27 15:17:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:26,531 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-08-27 15:17:26,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 15:17:26,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2021-08-27 15:17:26,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-08-27 15:17:26,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 33 transitions. [2021-08-27 15:17:26,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-27 15:17:26,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-08-27 15:17:26,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2021-08-27 15:17:26,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:17:26,533 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-08-27 15:17:26,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2021-08-27 15:17:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2021-08-27 15:17:26,534 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-08-27 15:17:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-08-27 15:17:26,534 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-08-27 15:17:26,534 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-08-27 15:17:26,534 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 15:17:26,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2021-08-27 15:17:26,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-08-27 15:17:26,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:26,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:26,535 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:26,535 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:26,535 INFO L791 eck$LassoCheckResult]: Stem: 954#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 955#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 958#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 959#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 976#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 974#L73 assume q1_#t~switch20;q1_~i~1 := 0; 975#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 966#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 967#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 977#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 978#L74-3 assume !(q1_~i~1 < q1_~N~0); 968#L74-4 q1_~i~1 := 0; 969#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 960#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 961#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 962#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 963#L76-3 assume !(q1_~i~1 < q1_~N~0); 956#L63 havoc q1_#t~switch20;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem9, bubblesort_#t~mem10, bubblesort_#t~mem11, bubblesort_#t~mem12, bubblesort_#t~pre8, bubblesort_#t~pre7, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 957#L18-3 [2021-08-27 15:17:26,536 INFO L793 eck$LassoCheckResult]: Loop: 957#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 971#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 972#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 964#L25 assume bubblesort_#t~mem9 > bubblesort_#t~mem10;havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10;call bubblesort_#t~mem11 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem11;havoc bubblesort_#t~mem11;call bubblesort_#t~mem12 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem12, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem12;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 965#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 973#L20-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 970#L18-2 bubblesort_#t~pre7 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre7; 957#L18-3 [2021-08-27 15:17:26,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:26,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1273080179, now seen corresponding path program 2 times [2021-08-27 15:17:26,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:26,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568335280] [2021-08-27 15:17:26,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:26,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:26,541 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:26,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [743875399] [2021-08-27 15:17:26,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 15:17:26,541 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:26,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:26,542 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:26,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-08-27 15:17:26,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 15:17:26,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-08-27 15:17:26,642 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:26,669 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:26,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:26,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 4 times [2021-08-27 15:17:26,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:26,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772184693] [2021-08-27 15:17:26,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:26,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:26,673 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:26,676 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:26,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1247881215, now seen corresponding path program 2 times [2021-08-27 15:17:26,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:26,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171544201] [2021-08-27 15:17:26,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:26,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:26,680 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:26,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463963945] [2021-08-27 15:17:26,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 15:17:26,680 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:26,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:26,681 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:26,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2021-08-27 15:17:26,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 15:17:26,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-08-27 15:17:26,777 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:26,810 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:30,329 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:17:30,329 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:17:30,329 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:17:30,330 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:17:30,330 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:17:30,330 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:30,330 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:17:30,330 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:17:30,330 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration11_Lasso [2021-08-27 15:17:30,330 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:17:30,330 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:17:30,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:30,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:30,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:30,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-08-27 15:17:31,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:31,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:32,342 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:17:32,342 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 15:17:32,342 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:32,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:32,343 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-08-27 15:17:32,344 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-08-27 15:17:32,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:32,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:32,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:32,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:32,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:32,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:32,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:32,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:32,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:32,382 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-08-27 15:17:32,382 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:32,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:32,383 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-08-27 15:17:32,383 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-08-27 15:17:32,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-08-27 15:17:32,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:32,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:32,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:32,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:32,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:32,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:32,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:32,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:32,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:32,422 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:32,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:32,422 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-08-27 15:17:32,423 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-08-27 15:17:32,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:32,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:32,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:32,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:32,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:32,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:32,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:32,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:32,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:32,452 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:32,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:32,453 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-08-27 15:17:32,454 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-08-27 15:17:32,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:32,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:32,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:32,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:32,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:32,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:32,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:32,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:32,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:32,494 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:32,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:32,494 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-08-27 15:17:32,495 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-08-27 15:17:32,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:32,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:32,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:32,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:32,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:32,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:32,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:32,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:32,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:32,535 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:32,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:32,535 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-08-27 15:17:32,536 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-08-27 15:17:32,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:32,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:32,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:32,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:32,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:32,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:32,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:32,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:32,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:32,575 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:32,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:32,576 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-08-27 15:17:32,576 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-08-27 15:17:32,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:32,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:32,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:32,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:32,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:32,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:32,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:32,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:32,651 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-08-27 15:17:32,651 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:32,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:32,652 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-08-27 15:17:32,653 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-08-27 15:17:32,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:32,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:32,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:32,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:32,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:32,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:32,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:32,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:32,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:32,691 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-08-27 15:17:32,691 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:32,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:32,692 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-08-27 15:17:32,692 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-08-27 15:17:32,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:32,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:32,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:32,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:32,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:32,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:32,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:32,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:32,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:32,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:32,730 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:32,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:32,731 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-08-27 15:17:32,732 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-08-27 15:17:32,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:32,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:32,740 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-08-27 15:17:32,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:32,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:32,749 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-08-27 15:17:32,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:32,765 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 15:17:32,781 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-08-27 15:17:32,782 INFO L444 ModelExtractionUtils]: 15 out of 37 variables were initially zero. Simplification set additionally 19 variables to zero. [2021-08-27 15:17:32,782 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:32,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:32,783 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-08-27 15:17:32,784 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-08-27 15:17:32,785 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 15:17:32,806 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 15:17:32,806 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 15:17:32,806 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubblesort_~a~0, ULTIMATE.start_bubblesort_~size) = -1*ULTIMATE.start_bubblesort_~a~0 + 1*ULTIMATE.start_bubblesort_~size Supporting invariants [] [2021-08-27 15:17:32,822 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-08-27 15:17:32,892 INFO L297 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2021-08-27 15:17:32,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:32,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 15:17:32,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:32,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:17:32,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 15:17:33,027 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-08-27 15:17:33,027 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-08-27 15:17:33,037 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-08-27 15:17:33,037 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-08-27 15:17:33,038 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-08-27 15:17:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2021-08-27 15:17:33,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 7 letters. [2021-08-27 15:17:33,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:33,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 25 letters. Loop has 7 letters. [2021-08-27 15:17:33,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:33,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 14 letters. [2021-08-27 15:17:33,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:33,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2021-08-27 15:17:33,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:17:33,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 38 transitions. [2021-08-27 15:17:33,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 15:17:33,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-08-27 15:17:33,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2021-08-27 15:17:33,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:17:33,040 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-08-27 15:17:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2021-08-27 15:17:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-08-27 15:17:33,041 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-08-27 15:17:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-08-27 15:17:33,041 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-08-27 15:17:33,041 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-08-27 15:17:33,041 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 15:17:33,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2021-08-27 15:17:33,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:17:33,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:33,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:33,042 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:17:33,042 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 15:17:33,043 INFO L791 eck$LassoCheckResult]: Stem: 1214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1215#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1218#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 1219#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 1241#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 1239#L73 assume q1_#t~switch20;q1_~i~1 := 0; 1240#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1228#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 1229#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1242#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 1243#L74-3 assume !(q1_~i~1 < q1_~N~0); 1230#L74-4 q1_~i~1 := 0; 1231#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1220#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 1221#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1222#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 1223#L76-3 assume !(q1_~i~1 < q1_~N~0); 1216#L63 havoc q1_#t~switch20;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem9, bubblesort_#t~mem10, bubblesort_#t~mem11, bubblesort_#t~mem12, bubblesort_#t~pre8, bubblesort_#t~pre7, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1217#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1234#L20-3 [2021-08-27 15:17:33,043 INFO L793 eck$LassoCheckResult]: Loop: 1234#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1236#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1224#L25 assume bubblesort_#t~mem9 > bubblesort_#t~mem10;havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10;call bubblesort_#t~mem11 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem11;havoc bubblesort_#t~mem11;call bubblesort_#t~mem12 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem12, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem12;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1225#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 1234#L20-3 [2021-08-27 15:17:33,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:33,043 INFO L82 PathProgramCache]: Analyzing trace with hash 810779970, now seen corresponding path program 1 times [2021-08-27 15:17:33,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:33,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101417690] [2021-08-27 15:17:33,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:33,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:33,047 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:33,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1466741026] [2021-08-27 15:17:33,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:33,048 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:33,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:33,049 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:33,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2021-08-27 15:17:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:33,177 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:33,203 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:33,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:33,204 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 1 times [2021-08-27 15:17:33,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:33,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861126620] [2021-08-27 15:17:33,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:33,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:33,208 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:33,210 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:33,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:33,210 INFO L82 PathProgramCache]: Analyzing trace with hash 618057612, now seen corresponding path program 1 times [2021-08-27 15:17:33,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:33,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729086519] [2021-08-27 15:17:33,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:33,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:33,243 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:33,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844892361] [2021-08-27 15:17:33,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:33,244 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:33,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:33,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-08-27 15:17:33,264 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:33,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2021-08-27 15:17:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:33,374 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:33,406 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:39,351 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:17:39,351 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:17:39,351 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:17:39,351 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:17:39,351 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:17:39,351 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:39,351 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:17:39,351 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:17:39,351 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration12_Lasso [2021-08-27 15:17:39,351 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:17:39,351 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:17:39,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-08-27 15:17:39,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-08-27 15:17:39,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:39,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:40,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:40,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:40,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:40,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:17:41,267 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:17:41,267 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 15:17:41,267 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,268 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-08-27 15:17:41,269 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-08-27 15:17:41,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:41,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:41,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:41,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:41,307 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,308 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-08-27 15:17:41,309 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-08-27 15:17:41,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:41,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:41,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:41,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,350 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-08-27 15:17:41,350 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,351 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-08-27 15:17:41,352 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-08-27 15:17:41,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:41,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:41,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:41,394 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,395 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-08-27 15:17:41,396 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-08-27 15:17:41,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:41,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:41,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:41,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,435 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-08-27 15:17:41,435 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,436 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-08-27 15:17:41,437 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-08-27 15:17:41,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-08-27 15:17:41,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:41,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:41,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:41,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:41,476 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,477 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-08-27 15:17:41,478 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-08-27 15:17:41,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:41,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:41,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:41,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,516 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-08-27 15:17:41,516 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,517 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:41,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-08-27 15:17:41,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:41,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:41,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:41,545 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,545 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:41,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-08-27 15:17:41,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:41,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:41,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:41,569 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:41,585 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,586 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-08-27 15:17:41,586 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-08-27 15:17:41,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:41,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:41,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,626 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-08-27 15:17:41,626 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,627 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-08-27 15:17:41,628 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-08-27 15:17:41,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:41,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:41,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:41,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,665 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-08-27 15:17:41,666 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,667 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-08-27 15:17:41,667 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-08-27 15:17:41,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:41,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:41,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,716 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-08-27 15:17:41,716 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,717 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-08-27 15:17:41,718 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-08-27 15:17:41,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:41,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:41,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:41,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:41,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,757 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-08-27 15:17:41,757 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-08-27 15:17:41,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:41,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:41,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:41,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:41,795 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,796 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-08-27 15:17:41,797 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-08-27 15:17:41,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:41,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:41,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:41,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-08-27 15:17:41,823 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,823 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-08-27 15:17:41,824 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-08-27 15:17:41,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-08-27 15:17:41,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:41,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:41,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:41,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:41,849 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,850 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-08-27 15:17:41,851 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-08-27 15:17:41,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:41,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:41,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2021-08-27 15:17:41,880 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,881 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-08-27 15:17:41,882 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-08-27 15:17:41,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:41,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:41,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:41,923 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,923 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-08-27 15:17:41,924 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-08-27 15:17:41,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:41,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:41,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:41,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:41,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:41,963 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:41,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:41,964 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-08-27 15:17:41,964 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-08-27 15:17:41,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:41,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:41,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:41,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:41,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:41,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:41,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:41,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:41,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:42,002 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-08-27 15:17:42,002 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:42,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:42,003 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-08-27 15:17:42,003 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-08-27 15:17:42,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:42,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:42,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:42,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:42,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:42,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:42,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:42,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:42,040 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-08-27 15:17:42,041 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:42,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:42,041 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-08-27 15:17:42,042 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-08-27 15:17:42,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:42,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:42,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:42,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:42,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:42,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:42,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:42,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:42,082 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-08-27 15:17:42,082 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:42,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:42,083 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-08-27 15:17:42,084 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-08-27 15:17:42,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:42,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:42,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:42,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:42,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:42,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:42,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:42,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:42,123 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-08-27 15:17:42,123 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:42,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:42,124 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-08-27 15:17:42,124 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-08-27 15:17:42,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:42,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:42,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:42,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:42,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:42,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:42,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:42,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:42,151 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-08-27 15:17:42,152 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:42,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:42,153 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-08-27 15:17:42,153 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-08-27 15:17:42,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:42,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:42,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:42,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:42,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:42,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:42,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:42,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:42,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:42,186 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-08-27 15:17:42,186 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:42,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:42,188 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-08-27 15:17:42,190 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-08-27 15:17:42,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:42,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:42,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:42,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:42,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:42,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:42,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:42,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:42,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2021-08-27 15:17:42,224 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:42,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:42,225 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-08-27 15:17:42,227 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-08-27 15:17:42,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:42,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:42,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:42,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:42,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:42,239 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:42,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:42,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:42,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:42,270 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:42,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:42,271 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-08-27 15:17:42,272 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-08-27 15:17:42,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:42,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:42,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:42,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:42,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:42,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:42,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:42,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:42,316 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-08-27 15:17:42,317 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:42,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:42,317 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-08-27 15:17:42,318 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-08-27 15:17:42,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:42,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:42,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:42,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:42,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:42,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:42,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:42,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:42,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:42,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:42,357 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:42,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:42,358 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-08-27 15:17:42,359 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-08-27 15:17:42,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:42,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:42,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:42,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:42,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:42,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:42,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:42,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:42,400 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-08-27 15:17:42,400 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:42,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:42,401 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:42,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2021-08-27 15:17:42,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:42,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:42,411 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-08-27 15:17:42,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:42,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:42,422 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-08-27 15:17:42,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:42,453 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 15:17:42,469 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-08-27 15:17:42,470 INFO L444 ModelExtractionUtils]: 21 out of 40 variables were initially zero. Simplification set additionally 15 variables to zero. [2021-08-27 15:17:42,470 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:42,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:42,471 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:42,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2021-08-27 15:17:42,472 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 15:17:42,489 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 15:17:42,490 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 15:17:42,490 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubblesort_~a~0, ULTIMATE.start_bubblesort_~b~0) = -2*ULTIMATE.start_bubblesort_~a~0 + 2*ULTIMATE.start_bubblesort_~b~0 + 1 Supporting invariants [] [2021-08-27 15:17:42,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:42,584 INFO L297 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2021-08-27 15:17:42,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:42,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 15:17:42,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:42,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:17:42,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:17:42,702 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-08-27 15:17:42,702 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-08-27 15:17:42,719 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 7 states. [2021-08-27 15:17:42,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 15:17:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-08-27 15:17:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2021-08-27 15:17:42,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2021-08-27 15:17:42,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:42,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 23 letters. Loop has 4 letters. [2021-08-27 15:17:42,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:42,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 8 letters. [2021-08-27 15:17:42,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:42,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2021-08-27 15:17:42,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:17:42,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 37 states and 46 transitions. [2021-08-27 15:17:42,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 15:17:42,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 15:17:42,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2021-08-27 15:17:42,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:17:42,722 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2021-08-27 15:17:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2021-08-27 15:17:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2021-08-27 15:17:42,723 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-08-27 15:17:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-08-27 15:17:42,723 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-08-27 15:17:42,723 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-08-27 15:17:42,723 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 15:17:42,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2021-08-27 15:17:42,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:17:42,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:42,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:42,724 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-08-27 15:17:42,724 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 15:17:42,725 INFO L791 eck$LassoCheckResult]: Stem: 1495#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1496#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1499#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 1500#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 1522#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 1520#L73 assume q1_#t~switch20;q1_~i~1 := 0; 1521#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1509#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 1510#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1523#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 1524#L74-3 assume !(q1_~i~1 < q1_~N~0); 1511#L74-4 q1_~i~1 := 0; 1512#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1501#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 1502#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1503#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 1504#L76-3 assume !(q1_~i~1 < q1_~N~0); 1497#L63 havoc q1_#t~switch20;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem9, bubblesort_#t~mem10, bubblesort_#t~mem11, bubblesort_#t~mem12, bubblesort_#t~pre8, bubblesort_#t~pre7, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1498#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1518#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1519#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1507#L25 assume !(bubblesort_#t~mem9 > bubblesort_#t~mem10);havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10; 1508#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 1516#L20-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1513#L18-2 bubblesort_#t~pre7 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre7; 1514#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1515#L20-3 [2021-08-27 15:17:42,725 INFO L793 eck$LassoCheckResult]: Loop: 1515#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1517#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1505#L25 assume bubblesort_#t~mem9 > bubblesort_#t~mem10;havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10;call bubblesort_#t~mem11 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem11;havoc bubblesort_#t~mem11;call bubblesort_#t~mem12 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem12, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem12;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1506#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 1515#L20-3 [2021-08-27 15:17:42,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash 31459128, now seen corresponding path program 1 times [2021-08-27 15:17:42,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:42,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172774611] [2021-08-27 15:17:42,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:42,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:42,730 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:42,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710754827] [2021-08-27 15:17:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:42,730 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:42,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:42,731 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-08-27 15:17:42,732 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-08-27 15:17:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:42,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 15:17:42,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 15:17:42,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:42,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172774611] [2021-08-27 15:17:42,956 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-27 15:17:42,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710754827] [2021-08-27 15:17:42,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710754827] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:17:42,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 15:17:42,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-27 15:17:42,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019485582] [2021-08-27 15:17:42,957 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:17:42,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:42,957 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 2 times [2021-08-27 15:17:42,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:42,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316721901] [2021-08-27 15:17:42,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:42,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:42,960 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:42,963 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:43,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:43,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 15:17:43,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 15:17:43,057 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 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-08-27 15:17:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:43,155 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2021-08-27 15:17:43,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 15:17:43,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2021-08-27 15:17:43,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:17:43,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 37 states and 44 transitions. [2021-08-27 15:17:43,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 15:17:43,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 15:17:43,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2021-08-27 15:17:43,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:17:43,157 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2021-08-27 15:17:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2021-08-27 15:17:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2021-08-27 15:17:43,158 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-08-27 15:17:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-08-27 15:17:43,158 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-08-27 15:17:43,158 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-08-27 15:17:43,158 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 15:17:43,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2021-08-27 15:17:43,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:17:43,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:43,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:43,159 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-08-27 15:17:43,159 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 15:17:43,159 INFO L791 eck$LassoCheckResult]: Stem: 1675#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1676#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1679#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 1680#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 1703#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 1701#L73 assume q1_#t~switch20;q1_~i~1 := 0; 1702#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1704#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 1705#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1689#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 1690#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1708#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 1707#L74-3 assume !(q1_~i~1 < q1_~N~0); 1691#L74-4 q1_~i~1 := 0; 1692#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1681#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 1682#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1683#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 1684#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1693#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 1706#L76-3 assume !(q1_~i~1 < q1_~N~0); 1677#L63 havoc q1_#t~switch20;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem9, bubblesort_#t~mem10, bubblesort_#t~mem11, bubblesort_#t~mem12, bubblesort_#t~pre8, bubblesort_#t~pre7, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1678#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1699#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1700#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1687#L25 assume !(bubblesort_#t~mem9 > bubblesort_#t~mem10);havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10; 1688#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 1697#L20-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1694#L18-2 bubblesort_#t~pre7 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre7; 1695#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1696#L20-3 [2021-08-27 15:17:43,159 INFO L793 eck$LassoCheckResult]: Loop: 1696#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1698#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1685#L25 assume bubblesort_#t~mem9 > bubblesort_#t~mem10;havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10;call bubblesort_#t~mem11 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem11;havoc bubblesort_#t~mem11;call bubblesort_#t~mem12 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem12, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem12;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1686#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 1696#L20-3 [2021-08-27 15:17:43,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:43,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1103015548, now seen corresponding path program 2 times [2021-08-27 15:17:43,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:43,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327087111] [2021-08-27 15:17:43,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:43,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:43,164 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:43,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860919987] [2021-08-27 15:17:43,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 15:17:43,164 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:43,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:43,165 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-08-27 15:17:43,166 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-08-27 15:17:43,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 15:17:43,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:17:43,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 15:17:43,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:43,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2021-08-27 15:17:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-27 15:17:43,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:43,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327087111] [2021-08-27 15:17:43,454 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-27 15:17:43,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860919987] [2021-08-27 15:17:43,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860919987] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:17:43,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 15:17:43,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-08-27 15:17:43,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590140463] [2021-08-27 15:17:43,455 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:17:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 3 times [2021-08-27 15:17:43,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:43,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57314163] [2021-08-27 15:17:43,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:43,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:43,459 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:43,462 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:43,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:43,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 15:17:43,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 15:17:43,556 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. cyclomatic complexity: 10 Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-08-27 15:17:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:43,673 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2021-08-27 15:17:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 15:17:43,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2021-08-27 15:17:43,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:17:43,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2021-08-27 15:17:43,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 15:17:43,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 15:17:43,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2021-08-27 15:17:43,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:17:43,674 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2021-08-27 15:17:43,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2021-08-27 15:17:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2021-08-27 15:17:43,676 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-08-27 15:17:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2021-08-27 15:17:43,676 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-08-27 15:17:43,676 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-08-27 15:17:43,676 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 15:17:43,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2021-08-27 15:17:43,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:17:43,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:43,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:43,676 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-08-27 15:17:43,676 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 15:17:43,677 INFO L791 eck$LassoCheckResult]: Stem: 1867#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1868#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1871#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 1872#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 1895#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 1893#L73 assume q1_#t~switch20;q1_~i~1 := 0; 1894#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1881#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 1882#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1896#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 1901#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1900#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 1899#L74-3 assume !(q1_~i~1 < q1_~N~0); 1883#L74-4 q1_~i~1 := 0; 1884#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1873#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 1874#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1875#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 1876#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1898#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 1897#L76-3 assume !(q1_~i~1 < q1_~N~0); 1869#L63 havoc q1_#t~switch20;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem9, bubblesort_#t~mem10, bubblesort_#t~mem11, bubblesort_#t~mem12, bubblesort_#t~pre8, bubblesort_#t~pre7, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1870#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1891#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1904#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1879#L25 assume !(bubblesort_#t~mem9 > bubblesort_#t~mem10);havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10; 1880#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 1889#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1890#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1892#L25 assume !(bubblesort_#t~mem9 > bubblesort_#t~mem10);havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10; 1903#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 1902#L20-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1885#L18-2 bubblesort_#t~pre7 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre7; 1886#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1887#L20-3 [2021-08-27 15:17:43,677 INFO L793 eck$LassoCheckResult]: Loop: 1887#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1888#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1877#L25 assume bubblesort_#t~mem9 > bubblesort_#t~mem10;havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10;call bubblesort_#t~mem11 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem11;havoc bubblesort_#t~mem11;call bubblesort_#t~mem12 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem12, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem12;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1878#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 1887#L20-3 [2021-08-27 15:17:43,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:43,677 INFO L82 PathProgramCache]: Analyzing trace with hash 545700084, now seen corresponding path program 3 times [2021-08-27 15:17:43,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:43,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006290721] [2021-08-27 15:17:43,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:43,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:43,682 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:43,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362520246] [2021-08-27 15:17:43,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 15:17:43,682 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:43,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:43,683 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-08-27 15:17:43,684 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-08-27 15:17:43,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 15:17:43,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-08-27 15:17:43,856 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:43,915 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:43,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:43,915 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 4 times [2021-08-27 15:17:43,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:43,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954478135] [2021-08-27 15:17:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:43,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:43,919 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:43,922 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:43,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:43,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1677403586, now seen corresponding path program 1 times [2021-08-27 15:17:43,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:43,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460140577] [2021-08-27 15:17:43,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:43,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:43,927 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:43,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620093789] [2021-08-27 15:17:43,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:43,927 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:43,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:43,928 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-08-27 15:17:43,929 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-08-27 15:17:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:44,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-27 15:17:44,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:44,715 INFO L354 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2021-08-27 15:17:44,716 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 64 treesize of output 36 [2021-08-27 15:17:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 15:17:44,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:44,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460140577] [2021-08-27 15:17:44,736 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-27 15:17:44,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620093789] [2021-08-27 15:17:44,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620093789] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:17:44,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 15:17:44,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2021-08-27 15:17:44,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8997432] [2021-08-27 15:17:44,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:44,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 15:17:44,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-08-27 15:17:44,842 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. cyclomatic complexity: 11 Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 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-08-27 15:17:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:45,522 INFO L93 Difference]: Finished difference Result 148 states and 182 transitions. [2021-08-27 15:17:45,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 15:17:45,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 182 transitions. [2021-08-27 15:17:45,526 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2021-08-27 15:17:45,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 148 states and 182 transitions. [2021-08-27 15:17:45,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2021-08-27 15:17:45,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2021-08-27 15:17:45,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 182 transitions. [2021-08-27 15:17:45,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:17:45,527 INFO L681 BuchiCegarLoop]: Abstraction has 148 states and 182 transitions. [2021-08-27 15:17:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 182 transitions. [2021-08-27 15:17:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 77. [2021-08-27 15:17:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 76 states have internal predecessors, (94), 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-08-27 15:17:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2021-08-27 15:17:45,542 INFO L704 BuchiCegarLoop]: Abstraction has 77 states and 94 transitions. [2021-08-27 15:17:45,542 INFO L587 BuchiCegarLoop]: Abstraction has 77 states and 94 transitions. [2021-08-27 15:17:45,542 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-27 15:17:45,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 94 transitions. [2021-08-27 15:17:45,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:17:45,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:45,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:45,544 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-08-27 15:17:45,545 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 15:17:45,545 INFO L791 eck$LassoCheckResult]: Stem: 2213#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2214#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 2217#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 2218#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 2245#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 2243#L73 assume q1_#t~switch20;q1_~i~1 := 0; 2244#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2246#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 2254#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2228#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 2229#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2247#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 2253#L74-3 assume !(q1_~i~1 < q1_~N~0); 2230#L74-4 q1_~i~1 := 0; 2231#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2219#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 2220#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2221#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 2222#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2233#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 2232#L76-3 assume !(q1_~i~1 < q1_~N~0); 2215#L63 havoc q1_#t~switch20;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem9, bubblesort_#t~mem10, bubblesort_#t~mem11, bubblesort_#t~mem12, bubblesort_#t~pre8, bubblesort_#t~pre7, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 2216#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2236#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2269#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2225#L25 assume bubblesort_#t~mem9 > bubblesort_#t~mem10;havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10;call bubblesort_#t~mem11 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem11;havoc bubblesort_#t~mem11;call bubblesort_#t~mem12 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem12, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem12;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2226#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 2270#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2256#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2260#L25 assume !(bubblesort_#t~mem9 > bubblesort_#t~mem10);havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10; 2259#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 2255#L20-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 2234#L18-2 bubblesort_#t~pre7 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre7; 2235#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2238#L20-3 [2021-08-27 15:17:45,545 INFO L793 eck$LassoCheckResult]: Loop: 2238#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2239#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2289#L25 assume bubblesort_#t~mem9 > bubblesort_#t~mem10;havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10;call bubblesort_#t~mem11 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem11;havoc bubblesort_#t~mem11;call bubblesort_#t~mem12 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem12, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem12;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2224#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 2238#L20-3 [2021-08-27 15:17:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:45,546 INFO L82 PathProgramCache]: Analyzing trace with hash -134358286, now seen corresponding path program 2 times [2021-08-27 15:17:45,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:45,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29933556] [2021-08-27 15:17:45,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:45,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:45,553 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:45,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233098743] [2021-08-27 15:17:45,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 15:17:45,553 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:45,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:45,554 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-08-27 15:17:45,603 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-08-27 15:17:45,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 15:17:45,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-08-27 15:17:45,785 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:45,840 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:45,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:45,840 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 5 times [2021-08-27 15:17:45,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:45,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102062311] [2021-08-27 15:17:45,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:45,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:45,844 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:45,846 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:45,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:45,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1090597572, now seen corresponding path program 3 times [2021-08-27 15:17:45,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:45,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019411708] [2021-08-27 15:17:45,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:45,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:45,858 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:45,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447797132] [2021-08-27 15:17:45,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 15:17:45,860 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:45,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:45,861 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-08-27 15:17:45,862 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-08-27 15:17:46,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 15:17:46,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:17:46,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 15:17:46,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:46,212 INFO L354 Elim1Store]: treesize reduction 57, result has 17.4 percent of original size [2021-08-27 15:17:46,213 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 72 treesize of output 38 [2021-08-27 15:17:46,413 INFO L354 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2021-08-27 15:17:46,414 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 52 treesize of output 24 [2021-08-27 15:17:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-27 15:17:46,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:46,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019411708] [2021-08-27 15:17:46,428 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-27 15:17:46,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447797132] [2021-08-27 15:17:46,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447797132] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:17:46,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 15:17:46,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-27 15:17:46,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309820713] [2021-08-27 15:17:46,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:46,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 15:17:46,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 15:17:46,529 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. cyclomatic complexity: 23 Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-08-27 15:17:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:46,690 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2021-08-27 15:17:46,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 15:17:46,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 162 transitions. [2021-08-27 15:17:46,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-08-27 15:17:46,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 132 states and 162 transitions. [2021-08-27 15:17:46,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-08-27 15:17:46,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-08-27 15:17:46,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 162 transitions. [2021-08-27 15:17:46,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:17:46,694 INFO L681 BuchiCegarLoop]: Abstraction has 132 states and 162 transitions. [2021-08-27 15:17:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 162 transitions. [2021-08-27 15:17:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2021-08-27 15:17:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 91 states have internal predecessors, (114), 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-08-27 15:17:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2021-08-27 15:17:46,696 INFO L704 BuchiCegarLoop]: Abstraction has 92 states and 114 transitions. [2021-08-27 15:17:46,696 INFO L587 BuchiCegarLoop]: Abstraction has 92 states and 114 transitions. [2021-08-27 15:17:46,696 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-27 15:17:46,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 114 transitions. [2021-08-27 15:17:46,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:17:46,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:46,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:46,697 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-08-27 15:17:46,697 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 15:17:46,697 INFO L791 eck$LassoCheckResult]: Stem: 2549#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2550#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet19, q1_#t~switch20, q1_#t~pre21, q1_#t~pre22, q1_#t~pre23, q1_#t~nondet25, q1_#t~mem26, q1_#t~mem27, q1_#t~post24, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 2553#L56 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet19;havoc q1_#t~nondet19;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch20 := false; 2554#L65 assume !q1_#t~switch20;q1_#t~switch20 := q1_#t~switch20; 2585#L69 assume !q1_#t~switch20;q1_#t~switch20 := true; 2583#L73 assume q1_#t~switch20;q1_~i~1 := 0; 2584#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2563#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 2564#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2599#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 2586#L74-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2587#L74-2 q1_#t~pre23 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre23; 2596#L74-3 assume !(q1_~i~1 < q1_~N~0); 2565#L74-4 q1_~i~1 := 0; 2566#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2555#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 2556#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2557#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 2558#L76-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet25 < 0 && 0 != q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet25 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet25;call q1_#t~mem26 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem26;havoc q1_#t~mem26;call q1_#t~mem27 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem27, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem27;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2625#L76-2 q1_#t~post24 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post24;havoc q1_#t~post24; 2588#L76-3 assume !(q1_~i~1 < q1_~N~0); 2589#L63 havoc q1_#t~switch20;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem9, bubblesort_#t~mem10, bubblesort_#t~mem11, bubblesort_#t~mem12, bubblesort_#t~pre8, bubblesort_#t~pre7, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 2573#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2574#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2638#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2637#L25 assume !(bubblesort_#t~mem9 > bubblesort_#t~mem10);havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10; 2632#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 2627#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2626#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2617#L25 assume bubblesort_#t~mem9 > bubblesort_#t~mem10;havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10;call bubblesort_#t~mem11 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem11;havoc bubblesort_#t~mem11;call bubblesort_#t~mem12 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem12, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem12;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2616#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 2604#L20-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 2605#L18-2 bubblesort_#t~pre7 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre7; 2600#L18-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2579#L20-3 [2021-08-27 15:17:46,697 INFO L793 eck$LassoCheckResult]: Loop: 2579#L20-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2581#L23 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem9 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem10 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2582#L25 assume bubblesort_#t~mem9 > bubblesort_#t~mem10;havoc bubblesort_#t~mem9;havoc bubblesort_#t~mem10;call bubblesort_#t~mem11 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem11;havoc bubblesort_#t~mem11;call bubblesort_#t~mem12 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem12, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem12;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2560#L20-2 bubblesort_#t~pre8 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre8; 2579#L20-3 [2021-08-27 15:17:46,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:46,698 INFO L82 PathProgramCache]: Analyzing trace with hash 543853042, now seen corresponding path program 4 times [2021-08-27 15:17:46,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:46,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469692813] [2021-08-27 15:17:46,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:46,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:46,707 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:46,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949683575] [2021-08-27 15:17:46,708 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 15:17:46,708 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:46,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:46,709 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:46,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2021-08-27 15:17:46,959 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 15:17:46,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-08-27 15:17:46,959 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:47,005 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:47,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:47,005 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 6 times [2021-08-27 15:17:47,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:47,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801848990] [2021-08-27 15:17:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:47,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:47,008 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:47,011 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:47,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:47,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1937505340, now seen corresponding path program 5 times [2021-08-27 15:17:47,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:47,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499560759] [2021-08-27 15:17:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:47,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:47,036 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 15:17:47,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [425821588] [2021-08-27 15:17:47,037 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 15:17:47,037 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:47,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:47,049 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:47,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2021-08-27 15:17:47,321 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-08-27 15:17:47,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-08-27 15:17:47,321 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:47,365 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:03,054 WARN L207 SmtUtils]: Spent 15.59 s on a formula simplification. DAG size of input: 392 DAG size of output: 309 [2021-08-27 15:18:53,501 WARN L207 SmtUtils]: Spent 10.64 s on a formula simplification. DAG size of input: 295 DAG size of output: 219 [2021-08-27 15:18:53,506 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:18:53,506 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:18:53,506 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:18:53,506 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:18:53,506 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:18:53,506 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:53,506 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:18:53,506 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:18:53,506 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration17_Lasso [2021-08-27 15:18:53,506 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:18:53,506 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:18:53,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:18:53,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:18:53,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:18:53,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:18:53,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:18:55,468 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-27 15:18:55,483 INFO L168 Benchmark]: Toolchain (without parser) took 99864.56 ms. Allocated memory was 67.1 MB in the beginning and 450.9 MB in the end (delta: 383.8 MB). Free memory was 47.9 MB in the beginning and 191.2 MB in the end (delta: -143.2 MB). Peak memory consumption was 315.7 MB. Max. memory is 16.1 GB. [2021-08-27 15:18:55,483 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 67.1 MB. Free memory is still 49.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 15:18:55,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.81 ms. Allocated memory is still 67.1 MB. Free memory was 47.8 MB in the beginning and 50.5 MB in the end (delta: -2.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 15:18:55,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.81 ms. Allocated memory is still 67.1 MB. Free memory was 50.5 MB in the beginning and 48.5 MB in the end (delta: 2.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 15:18:55,483 INFO L168 Benchmark]: Boogie Preprocessor took 28.75 ms. Allocated memory is still 67.1 MB. Free memory was 48.5 MB in the beginning and 47.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 15:18:55,484 INFO L168 Benchmark]: RCFGBuilder took 400.34 ms. Allocated memory was 67.1 MB in the beginning and 96.5 MB in the end (delta: 29.4 MB). Free memory was 47.2 MB in the beginning and 76.5 MB in the end (delta: -29.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. [2021-08-27 15:18:55,484 INFO L168 Benchmark]: BuchiAutomizer took 99145.57 ms. Allocated memory was 96.5 MB in the beginning and 450.9 MB in the end (delta: 354.4 MB). Free memory was 76.0 MB in the beginning and 191.2 MB in the end (delta: -115.1 MB). Peak memory consumption was 315.2 MB. Max. memory is 16.1 GB. [2021-08-27 15:18:55,485 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 67.1 MB. Free memory is still 49.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 243.81 ms. Allocated memory is still 67.1 MB. Free memory was 47.8 MB in the beginning and 50.5 MB in the end (delta: -2.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.81 ms. Allocated memory is still 67.1 MB. Free memory was 50.5 MB in the beginning and 48.5 MB in the end (delta: 2.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.75 ms. Allocated memory is still 67.1 MB. Free memory was 48.5 MB in the beginning and 47.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 400.34 ms. Allocated memory was 67.1 MB in the beginning and 96.5 MB in the end (delta: 29.4 MB). Free memory was 47.2 MB in the beginning and 76.5 MB in the end (delta: -29.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 99145.57 ms. Allocated memory was 96.5 MB in the beginning and 450.9 MB in the end (delta: 354.4 MB). Free memory was 76.0 MB in the beginning and 191.2 MB in the end (delta: -115.1 MB). Peak memory consumption was 315.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-27 15:18:55,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:55,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2021-08-27 15:18:55,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2021-08-27 15:18:56,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:56,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:56,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:56,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:56,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2021-08-27 15:18:57,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:57,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:57,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:57,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:57,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2021-08-27 15:18:58,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2021-08-27 15:18:58,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2021-08-27 15:18:58,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:58,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:58,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:59,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:59,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2021-08-27 15:18:59,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-08-27 15:18:59,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-08-27 15:19:00,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...