./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 682a48acff360d61f631a6f73c43d35eb5554cb5c1e29a6f88508c15be8e86ce --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:09:53,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:09:53,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:09:53,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:09:53,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:09:53,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:09:53,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:09:53,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:09:53,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:09:53,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:09:53,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:09:53,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:09:53,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:09:53,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:09:53,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:09:53,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:09:53,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:09:53,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:09:53,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:09:53,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:09:53,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:09:53,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:09:53,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:09:53,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:09:53,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:09:53,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:09:53,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:09:53,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:09:53,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:09:53,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:09:53,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:09:53,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:09:53,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:09:53,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:09:53,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:09:53,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:09:53,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:09:53,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:09:53,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:09:53,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:09:53,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:09:53,746 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-14 23:09:53,763 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:09:53,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:09:53,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:09:53,764 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:09:53,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:09:53,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:09:53,765 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:09:53,765 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:09:53,766 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:09:53,766 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:09:53,766 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:09:53,766 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:09:53,766 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:09:53,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:09:53,766 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:09:53,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:09:53,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:09:53,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:09:53,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:09:53,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:09:53,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:09:53,767 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:09:53,767 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:09:53,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:09:53,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:09:53,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:09:53,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:09:53,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:09:53,768 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:09:53,769 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:09:53,769 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 682a48acff360d61f631a6f73c43d35eb5554cb5c1e29a6f88508c15be8e86ce [2021-12-14 23:09:53,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:09:53,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:09:53,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:09:53,973 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:09:53,973 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:09:53,974 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i [2021-12-14 23:09:54,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8198e7c45/852b540c921c442aab02b46fcb097bd1/FLAG7a07bcc24 [2021-12-14 23:09:54,377 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:09:54,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i [2021-12-14 23:09:54,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8198e7c45/852b540c921c442aab02b46fcb097bd1/FLAG7a07bcc24 [2021-12-14 23:09:54,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8198e7c45/852b540c921c442aab02b46fcb097bd1 [2021-12-14 23:09:54,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:09:54,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:09:54,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:09:54,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:09:54,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:09:54,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:09:54" (1/1) ... [2021-12-14 23:09:54,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165918a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:09:54, skipping insertion in model container [2021-12-14 23:09:54,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:09:54" (1/1) ... [2021-12-14 23:09:54,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:09:54,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:09:54,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:09:54,933 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:09:54,944 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:09:54,954 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:09:54,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:09:54 WrapperNode [2021-12-14 23:09:54,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:09:54,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:09:54,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:09:54,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:09:54,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:09:54" (1/1) ... [2021-12-14 23:09:54,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:09:54" (1/1) ... [2021-12-14 23:09:54,980 INFO L137 Inliner]: procedures = 11, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2021-12-14 23:09:54,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:09:54,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:09:54,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:09:54,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:09:54,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:09:54" (1/1) ... [2021-12-14 23:09:54,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:09:54" (1/1) ... [2021-12-14 23:09:55,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:09:54" (1/1) ... [2021-12-14 23:09:55,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:09:54" (1/1) ... [2021-12-14 23:09:55,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:09:54" (1/1) ... [2021-12-14 23:09:55,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:09:54" (1/1) ... [2021-12-14 23:09:55,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:09:54" (1/1) ... [2021-12-14 23:09:55,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:09:55,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:09:55,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:09:55,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:09:55,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:09:54" (1/1) ... [2021-12-14 23:09:55,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:09:55,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:09:55,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:09:55,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-14 23:09:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 23:09:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2021-12-14 23:09:55,098 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2021-12-14 23:09:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 23:09:55,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:09:55,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:09:55,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 23:09:55,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 23:09:55,149 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:09:55,150 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:09:55,268 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:09:55,272 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:09:55,272 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 23:09:55,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:09:55 BoogieIcfgContainer [2021-12-14 23:09:55,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:09:55,275 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:09:55,275 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:09:55,277 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:09:55,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:09:55,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:09:54" (1/3) ... [2021-12-14 23:09:55,279 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c6cb31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:09:55, skipping insertion in model container [2021-12-14 23:09:55,279 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:09:55,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:09:54" (2/3) ... [2021-12-14 23:09:55,280 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c6cb31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:09:55, skipping insertion in model container [2021-12-14 23:09:55,280 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:09:55,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:09:55" (3/3) ... [2021-12-14 23:09:55,281 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex9.i [2021-12-14 23:09:55,310 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:09:55,310 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:09:55,310 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:09:55,311 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:09:55,311 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:09:55,311 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:09:55,311 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:09:55,311 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:09:55,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 23:09:55,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-14 23:09:55,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:09:55,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:09:55,337 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:09:55,337 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:09:55,337 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:09:55,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 23:09:55,339 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-14 23:09:55,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:09:55,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:09:55,340 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:09:55,340 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:09:55,344 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem6#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; 11#L29-3true [2021-12-14 23:09:55,344 INFO L793 eck$LassoCheckResult]: Loop: 11#L29-3true call main_#t~mem6#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 8#L29-1true assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 9#L33true call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 14#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 12#L9true assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 16#recFINALtrue assume true; 15#recEXITtrue >#33#return; 6#L33-1true havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; 11#L29-3true [2021-12-14 23:09:55,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:09:55,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2021-12-14 23:09:55,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:09:55,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822493519] [2021-12-14 23:09:55,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:09:55,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:09:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:09:55,427 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:09:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:09:55,453 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:09:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:09:55,455 INFO L85 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2021-12-14 23:09:55,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:09:55,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412875341] [2021-12-14 23:09:55,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:09:55,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:09:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:09:55,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 23:09:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:09:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:09:55,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:09:55,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412875341] [2021-12-14 23:09:55,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412875341] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:09:55,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:09:55,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 23:09:55,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231271787] [2021-12-14 23:09:55,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:09:55,624 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:09:55,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:09:55,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 23:09:55,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 23:09:55,648 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 23:09:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:09:55,713 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2021-12-14 23:09:55,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 23:09:55,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2021-12-14 23:09:55,719 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-14 23:09:55,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2021-12-14 23:09:55,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-14 23:09:55,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-14 23:09:55,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2021-12-14 23:09:55,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:09:55,725 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-14 23:09:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2021-12-14 23:09:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-14 23:09:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 23:09:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-12-14 23:09:55,750 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-14 23:09:55,750 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-14 23:09:55,750 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:09:55,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2021-12-14 23:09:55,752 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-14 23:09:55,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:09:55,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:09:55,753 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:09:55,753 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:09:55,753 INFO L791 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 56#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem6#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; 57#L29-3 [2021-12-14 23:09:55,754 INFO L793 eck$LassoCheckResult]: Loop: 57#L29-3 call main_#t~mem6#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 58#L29-1 assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 61#L33 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 66#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 59#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 60#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 66#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 59#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 62#recFINAL assume true; 67#recEXIT >#31#return; 63#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 64#recFINAL assume true; 68#recEXIT >#33#return; 65#L33-1 havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; 57#L29-3 [2021-12-14 23:09:55,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:09:55,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2021-12-14 23:09:55,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:09:55,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869050700] [2021-12-14 23:09:55,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:09:55,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:09:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:09:55,785 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:09:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:09:55,797 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:09:55,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:09:55,798 INFO L85 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2021-12-14 23:09:55,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:09:55,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779010144] [2021-12-14 23:09:55,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:09:55,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:09:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:09:55,836 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:09:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:09:55,857 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:09:55,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:09:55,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1849555021, now seen corresponding path program 1 times [2021-12-14 23:09:55,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:09:55,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961329111] [2021-12-14 23:09:55,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:09:55,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:09:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:09:55,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 23:09:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:09:56,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 23:09:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:09:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 23:09:56,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:09:56,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961329111] [2021-12-14 23:09:56,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961329111] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:09:56,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866612352] [2021-12-14 23:09:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:09:56,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:09:56,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:09:56,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:09:56,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 23:09:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:09:56,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 23:09:56,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:09:56,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-14 23:09:56,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:09:56,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-14 23:09:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 23:09:56,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:09:56,444 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_140 Int) (v_ArrVal_141 (Array Int Int)) (|ULTIMATE.start_main_~pp~0#1.offset| Int) (v_ArrVal_137 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~qq~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~pp~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~qq~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset| v_ArrVal_140)) |c_ULTIMATE.start_main_~qq~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|)) (< (+ v_ArrVal_140 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~qq~0#1.base|) |c_ULTIMATE.start_main_~qq~0#1.offset|)))) (<= |c_ULTIMATE.start_main_#t~mem6#1| 1)) is different from false [2021-12-14 23:09:56,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-14 23:09:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:09:56,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866612352] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:09:56,518 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:09:56,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 15 [2021-12-14 23:09:56,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283067940] [2021-12-14 23:09:56,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:09:57,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:09:57,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 23:09:57,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=144, Unknown=1, NotChecked=24, Total=210 [2021-12-14 23:09:57,364 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 23:09:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:09:57,442 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-12-14 23:09:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 23:09:57,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2021-12-14 23:09:57,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-14 23:09:57,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2021-12-14 23:09:57,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-14 23:09:57,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-14 23:09:57,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2021-12-14 23:09:57,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:09:57,445 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-14 23:09:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2021-12-14 23:09:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-14 23:09:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 23:09:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-12-14 23:09:57,447 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-14 23:09:57,447 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-14 23:09:57,447 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:09:57,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2021-12-14 23:09:57,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-14 23:09:57,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:09:57,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:09:57,449 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:09:57,449 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-14 23:09:57,449 INFO L791 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem6#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; 219#L29-3 [2021-12-14 23:09:57,449 INFO L793 eck$LassoCheckResult]: Loop: 219#L29-3 call main_#t~mem6#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 220#L29-1 assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 222#L33 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 228#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 221#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 223#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 228#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 221#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 223#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 228#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 221#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 224#recFINAL assume true; 229#recEXIT >#31#return; 225#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 226#recFINAL assume true; 233#recEXIT >#31#return; 231#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 232#recFINAL assume true; 230#recEXIT >#33#return; 227#L33-1 havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; 219#L29-3 [2021-12-14 23:09:57,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:09:57,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2021-12-14 23:09:57,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:09:57,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109951583] [2021-12-14 23:09:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:09:57,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:09:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:09:57,458 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:09:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:09:57,463 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:09:57,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:09:57,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2021-12-14 23:09:57,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:09:57,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528927922] [2021-12-14 23:09:57,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:09:57,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:09:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:09:57,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:09:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:09:57,499 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:09:57,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:09:57,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1421169023, now seen corresponding path program 2 times [2021-12-14 23:09:57,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:09:57,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003454233] [2021-12-14 23:09:57,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:09:57,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:09:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:09:57,527 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:09:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:09:57,545 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:09:59,040 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:09:59,040 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:09:59,041 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:09:59,041 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:09:59,041 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:09:59,041 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:09:59,041 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:09:59,041 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:09:59,041 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex9.i_Iteration3_Lasso [2021-12-14 23:09:59,041 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:09:59,042 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:09:59,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:09:59,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:09:59,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:09:59,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:09:59,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:09:59,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-12-14 23:09:59,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:09:59,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-12-14 23:09:59,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-12-14 23:09:59,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-12-14 23:09:59,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:09:59,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-12-14 23:09:59,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:09:59,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:09:59,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:09:59,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-12-14 23:09:59,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:09:59,438 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:09:59,442 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:09:59,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:09:59,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:09:59,445 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:09:59,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:09:59,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-14 23:09:59,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:09:59,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:09:59,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:09:59,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:09:59,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:09:59,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:09:59,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:09:59,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:09:59,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-14 23:09:59,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:09:59,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:09:59,524 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:09:59,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-14 23:09:59,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:09:59,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:09:59,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:09:59,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:09:59,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:09:59,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:09:59,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:09:59,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:09:59,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:09:59,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-14 23:09:59,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:09:59,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:09:59,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:09:59,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-14 23:09:59,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:09:59,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:09:59,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:09:59,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:09:59,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:09:59,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:09:59,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:09:59,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:09:59,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-14 23:09:59,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:09:59,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:09:59,622 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:09:59,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-14 23:09:59,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:09:59,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:09:59,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:09:59,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:09:59,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:09:59,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:09:59,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:09:59,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:09:59,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:09:59,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-14 23:09:59,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:09:59,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:09:59,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:09:59,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-14 23:09:59,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:09:59,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:09:59,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:09:59,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:09:59,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:09:59,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:09:59,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:09:59,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:09:59,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-14 23:09:59,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:09:59,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:09:59,722 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:09:59,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-14 23:09:59,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:09:59,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:09:59,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:09:59,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:09:59,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:09:59,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:09:59,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:09:59,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:09:59,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2021-12-14 23:09:59,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:09:59,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:09:59,764 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:09:59,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-14 23:09:59,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:09:59,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:09:59,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:09:59,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:09:59,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:09:59,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:09:59,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:09:59,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:09:59,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-14 23:09:59,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:09:59,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:09:59,797 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:09:59,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-14 23:09:59,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:09:59,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:09:59,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:09:59,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:09:59,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:09:59,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:09:59,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:09:59,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:09:59,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-14 23:09:59,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:09:59,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:09:59,838 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:09:59,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-14 23:09:59,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:09:59,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:09:59,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:09:59,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:09:59,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:09:59,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:09:59,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:09:59,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:09:59,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:09:59,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-14 23:09:59,882 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:09:59,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:09:59,885 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:09:59,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-14 23:09:59,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:09:59,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:09:59,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:09:59,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:09:59,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:09:59,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:09:59,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:09:59,907 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:09:59,914 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-14 23:09:59,915 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2021-12-14 23:09:59,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:09:59,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:09:59,917 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:09:59,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-14 23:09:59,919 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:09:59,940 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:09:59,940 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:09:59,941 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1 Supporting invariants [] [2021-12-14 23:09:59,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-14 23:09:59,966 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2021-12-14 23:09:59,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:09:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:09:59,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:09:59,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:00,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-14 23:10:00,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:00,114 INFO L354 Elim1Store]: treesize reduction 52, result has 52.3 percent of original size [2021-12-14 23:10:00,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 130 treesize of output 148 [2021-12-14 23:10:00,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2021-12-14 23:10:00,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-14 23:10:00,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-12-14 23:10:00,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-12-14 23:10:00,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-12-14 23:10:00,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:00,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-14 23:10:00,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:10:00,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-14 23:10:00,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-12-14 23:10:00,430 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:10:00,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2021-12-14 23:10:00,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-14 23:10:00,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 23:10:00,510 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:10:00,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2021-12-14 23:10:00,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-14 23:10:00,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2021-12-14 23:10:02,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 23:10:03,077 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 23:10:03,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-14 23:10:03,345 INFO L354 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2021-12-14 23:10:03,345 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 54 treesize of output 76 [2021-12-14 23:10:03,359 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-14 23:10:03,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 23:10:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:10:03,767 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 15 loop predicates [2021-12-14 23:10:03,767 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 23:10:03,864 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Result 33 states and 45 transitions. Complement of second has 17 states. [2021-12-14 23:10:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-14 23:10:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 23:10:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2021-12-14 23:10:03,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. Stem has 2 letters. Loop has 20 letters. [2021-12-14 23:10:03,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:03,868 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-14 23:10:03,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:03,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:10:03,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:03,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-14 23:10:03,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:03,963 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-14 23:10:03,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 61 [2021-12-14 23:10:03,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 23:10:03,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 23:10:03,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 23:10:03,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 23:10:04,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-12-14 23:10:04,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-14 23:10:05,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 23:10:06,846 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 23:10:06,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-14 23:10:07,104 INFO L354 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2021-12-14 23:10:07,106 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 26 treesize of output 56 [2021-12-14 23:10:07,114 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 23:10:07,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 23:10:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:10:07,272 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 15 loop predicates [2021-12-14 23:10:07,272 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 23:10:07,360 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Result 34 states and 46 transitions. Complement of second has 19 states. [2021-12-14 23:10:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2021-12-14 23:10:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 23:10:07,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2021-12-14 23:10:07,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. Stem has 2 letters. Loop has 20 letters. [2021-12-14 23:10:07,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:07,363 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-14 23:10:07,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:07,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:10:07,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:07,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-14 23:10:07,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:07,514 INFO L354 Elim1Store]: treesize reduction 52, result has 52.3 percent of original size [2021-12-14 23:10:07,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 130 treesize of output 148 [2021-12-14 23:10:07,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2021-12-14 23:10:07,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-14 23:10:07,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-12-14 23:10:07,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-12-14 23:10:07,616 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:10:07,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 76 [2021-12-14 23:10:07,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-12-14 23:10:07,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-14 23:10:07,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-12-14 23:10:07,865 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:10:07,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 77 [2021-12-14 23:10:07,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2021-12-14 23:10:07,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-14 23:10:07,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-12-14 23:10:07,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2021-12-14 23:10:08,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:10:08,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:10:08,261 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 23:10:08,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 50 [2021-12-14 23:10:08,274 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-14 23:10:08,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-12-14 23:10:08,313 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 23:10:08,313 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2021-12-14 23:10:08,314 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 23:10:08,381 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Result 33 states and 45 transitions. Complement of second has 17 states. [2021-12-14 23:10:08,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-14 23:10:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 23:10:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2021-12-14 23:10:08,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 20 letters. [2021-12-14 23:10:08,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:08,385 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-14 23:10:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:08,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:10:08,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:08,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-14 23:10:08,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:08,511 INFO L354 Elim1Store]: treesize reduction 52, result has 52.3 percent of original size [2021-12-14 23:10:08,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 130 treesize of output 148 [2021-12-14 23:10:08,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2021-12-14 23:10:08,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-14 23:10:08,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-12-14 23:10:08,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2021-12-14 23:10:08,585 INFO L354 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2021-12-14 23:10:08,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 65 [2021-12-14 23:10:08,656 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:10:08,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2021-12-14 23:10:08,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2021-12-14 23:10:08,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2021-12-14 23:10:08,801 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:10:08,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 23:10:08,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-12-14 23:10:08,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 23:10:08,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2021-12-14 23:10:09,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:10:09,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:10:09,292 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 23:10:09,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 50 [2021-12-14 23:10:09,311 INFO L354 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2021-12-14 23:10:09,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 45 [2021-12-14 23:10:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 23:10:09,361 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 13 loop predicates [2021-12-14 23:10:09,361 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 23:10:09,465 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Result 34 states and 46 transitions. Complement of second has 19 states. [2021-12-14 23:10:09,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2021-12-14 23:10:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 23:10:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2021-12-14 23:10:09,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 2 letters. Loop has 20 letters. [2021-12-14 23:10:09,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:09,468 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-14 23:10:09,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:09,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:10:09,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:09,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-14 23:10:09,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:09,566 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-14 23:10:09,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 61 [2021-12-14 23:10:09,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 23:10:09,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 23:10:09,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 23:10:09,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-14 23:10:09,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-12-14 23:10:09,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-14 23:10:10,052 INFO L354 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2021-12-14 23:10:10,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 45 [2021-12-14 23:10:10,059 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 23:10:10,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2021-12-14 23:10:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 23:10:10,089 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2021-12-14 23:10:10,089 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 23:10:10,232 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,232 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,242 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,245 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,249 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,274 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,275 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,276 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,277 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,277 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,278 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,278 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,279 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,280 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,281 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,285 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,286 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,287 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,288 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,289 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,289 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,289 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,290 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,290 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,291 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,292 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,293 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,293 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,293 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,295 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,297 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,297 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,298 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,299 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,300 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,300 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,301 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,301 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,329 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,344 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,345 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,346 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,347 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,347 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,347 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,349 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,351 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,352 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,353 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,354 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,354 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,355 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,355 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,355 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,356 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,371 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,372 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,372 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,378 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,379 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,380 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,380 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,381 WARN L278 uchiComplementFKVNwa]: big16 [2021-12-14 23:10:10,382 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,382 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,383 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,383 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,384 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,384 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,385 WARN L278 uchiComplementFKVNwa]: big8 [2021-12-14 23:10:10,422 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Result 1106 states and 3582 transitions. Complement of second has 1077 states 13 powerset states1064 rank states. The highest rank that occured is 9 [2021-12-14 23:10:10,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2021-12-14 23:10:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 23:10:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2021-12-14 23:10:10,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 2 letters. Loop has 20 letters. [2021-12-14 23:10:10,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:10,431 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-14 23:10:10,431 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: no settings was sufficient at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-14 23:10:10,446 INFO L158 Benchmark]: Toolchain (without parser) took 15631.10ms. Allocated memory was 119.5MB in the beginning and 232.8MB in the end (delta: 113.2MB). Free memory was 95.8MB in the beginning and 108.9MB in the end (delta: -13.0MB). Peak memory consumption was 135.9MB. Max. memory is 16.1GB. [2021-12-14 23:10:10,446 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory was 43.5MB in the beginning and 43.4MB in the end (delta: 40.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:10:10,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 128.45ms. Allocated memory is still 119.5MB. Free memory was 95.4MB in the beginning and 86.6MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 23:10:10,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.75ms. Allocated memory is still 119.5MB. Free memory was 86.6MB in the beginning and 98.2MB in the end (delta: -11.6MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2021-12-14 23:10:10,447 INFO L158 Benchmark]: Boogie Preprocessor took 44.11ms. Allocated memory is still 119.5MB. Free memory was 98.2MB in the beginning and 97.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:10:10,447 INFO L158 Benchmark]: RCFGBuilder took 248.25ms. Allocated memory is still 119.5MB. Free memory was 97.0MB in the beginning and 86.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 23:10:10,447 INFO L158 Benchmark]: BuchiAutomizer took 15170.74ms. Allocated memory was 119.5MB in the beginning and 232.8MB in the end (delta: 113.2MB). Free memory was 86.1MB in the beginning and 108.9MB in the end (delta: -22.8MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. [2021-12-14 23:10:10,448 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.15ms. Allocated memory is still 71.3MB. Free memory was 43.5MB in the beginning and 43.4MB in the end (delta: 40.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 128.45ms. Allocated memory is still 119.5MB. Free memory was 95.4MB in the beginning and 86.6MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.75ms. Allocated memory is still 119.5MB. Free memory was 86.6MB in the beginning and 98.2MB in the end (delta: -11.6MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.11ms. Allocated memory is still 119.5MB. Free memory was 98.2MB in the beginning and 97.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 248.25ms. Allocated memory is still 119.5MB. Free memory was 97.0MB in the beginning and 86.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 15170.74ms. Allocated memory was 119.5MB in the beginning and 232.8MB in the end (delta: 113.2MB). Free memory was 86.1MB in the beginning and 108.9MB in the end (delta: -22.8MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: no settings was sufficient de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: no settings was sufficient: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-14 23:10:10,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:10,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no settings was sufficient