./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/string-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/string-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c71ebd98a3b6e7de0397eeeb86fda8d96b2d4c8ea0b8e1766ce392ff80613de --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:58:21,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:58:21,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:58:21,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:58:21,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:58:21,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:58:21,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:58:21,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:58:21,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:58:21,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:58:21,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:58:21,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:58:21,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:58:21,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:58:21,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:58:21,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:58:21,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:58:21,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:58:21,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:58:21,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:58:21,570 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:58:21,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:58:21,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:58:21,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:58:21,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:58:21,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:58:21,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:58:21,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:58:21,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:58:21,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:58:21,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:58:21,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:58:21,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:58:21,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:58:21,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:58:21,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:58:21,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:58:21,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:58:21,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:58:21,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:58:21,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:58:21,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:58:21,585 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:58:21,615 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:58:21,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:58:21,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:58:21,616 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:58:21,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:58:21,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:58:21,618 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:58:21,619 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:58:21,619 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:58:21,619 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:58:21,620 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:58:21,620 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:58:21,620 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:58:21,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:58:21,620 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:58:21,620 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:58:21,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:58:21,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:58:21,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:58:21,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:58:21,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:58:21,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:58:21,621 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:58:21,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:58:21,622 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:58:21,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:58:21,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:58:21,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:58:21,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:58:21,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:58:21,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:58:21,624 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:58:21,625 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c71ebd98a3b6e7de0397eeeb86fda8d96b2d4c8ea0b8e1766ce392ff80613de [2022-07-13 03:58:21,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:58:21,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:58:21,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:58:21,868 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:58:21,868 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:58:21,869 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-1.i [2022-07-13 03:58:21,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11193f202/7fab9776e65943e19acaea4daaa728c9/FLAG694f56f3f [2022-07-13 03:58:22,301 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:58:22,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-1.i [2022-07-13 03:58:22,307 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11193f202/7fab9776e65943e19acaea4daaa728c9/FLAG694f56f3f [2022-07-13 03:58:22,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11193f202/7fab9776e65943e19acaea4daaa728c9 [2022-07-13 03:58:22,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:58:22,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:58:22,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:58:22,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:58:22,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:58:22,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:58:22" (1/1) ... [2022-07-13 03:58:22,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b852db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:58:22, skipping insertion in model container [2022-07-13 03:58:22,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:58:22" (1/1) ... [2022-07-13 03:58:22,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:58:22,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:58:22,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-1.i[896,909] [2022-07-13 03:58:22,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:58:22,528 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:58:22,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-1.i[896,909] [2022-07-13 03:58:22,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:58:22,569 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:58:22,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:58:22 WrapperNode [2022-07-13 03:58:22,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:58:22,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:58:22,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:58:22,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:58:22,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:58:22" (1/1) ... [2022-07-13 03:58:22,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:58:22" (1/1) ... [2022-07-13 03:58:22,610 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2022-07-13 03:58:22,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:58:22,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:58:22,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:58:22,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:58:22,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:58:22" (1/1) ... [2022-07-13 03:58:22,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:58:22" (1/1) ... [2022-07-13 03:58:22,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:58:22" (1/1) ... [2022-07-13 03:58:22,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:58:22" (1/1) ... [2022-07-13 03:58:22,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:58:22" (1/1) ... [2022-07-13 03:58:22,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:58:22" (1/1) ... [2022-07-13 03:58:22,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:58:22" (1/1) ... [2022-07-13 03:58:22,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:58:22,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:58:22,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:58:22,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:58:22,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:58:22" (1/1) ... [2022-07-13 03:58:22,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:22,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:22,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:22,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:58:22,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:58:22,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:58:22,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 03:58:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:58:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:58:22,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:58:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:58:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:58:22,757 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:58:22,758 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:58:22,923 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:58:22,933 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:58:22,933 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-13 03:58:22,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:58:22 BoogieIcfgContainer [2022-07-13 03:58:22,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:58:22,935 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:58:22,935 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:58:22,938 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:58:22,938 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:58:22,938 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:58:22" (1/3) ... [2022-07-13 03:58:22,939 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@627801cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:58:22, skipping insertion in model container [2022-07-13 03:58:22,939 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:58:22,939 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:58:22" (2/3) ... [2022-07-13 03:58:22,939 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@627801cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:58:22, skipping insertion in model container [2022-07-13 03:58:22,939 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:58:22,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:58:22" (3/3) ... [2022-07-13 03:58:22,940 INFO L354 chiAutomizerObserver]: Analyzing ICFG string-1.i [2022-07-13 03:58:22,990 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:58:22,990 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:58:22,990 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:58:22,990 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:58:22,990 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:58:22,990 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:58:22,991 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:58:22,991 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:58:22,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:58:23,006 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2022-07-13 03:58:23,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:58:23,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:58:23,010 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:58:23,011 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:58:23,011 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:58:23,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:58:23,014 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2022-07-13 03:58:23,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:58:23,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:58:23,015 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:58:23,015 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:58:23,020 INFO L752 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 23#L33-3true [2022-07-13 03:58:23,020 INFO L754 eck$LassoCheckResult]: Loop: 23#L33-3true assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 17#L33-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 23#L33-3true [2022-07-13 03:58:23,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:23,026 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:58:23,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:23,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125137783] [2022-07-13 03:58:23,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:23,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:23,119 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:58:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:23,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:58:23,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-13 03:58:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:23,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843362648] [2022-07-13 03:58:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:23,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:23,178 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:58:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:23,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:58:23,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:23,202 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-13 03:58:23,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:23,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114331883] [2022-07-13 03:58:23,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:23,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:23,235 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:58:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:23,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:58:23,602 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:58:23,603 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:58:23,604 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:58:23,604 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:58:23,604 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:58:23,604 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:23,604 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:58:23,605 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:58:23,605 INFO L133 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration1_Lasso [2022-07-13 03:58:23,605 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:58:23,605 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:58:23,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:23,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:24,110 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:58:24,113 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:58:24,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 03:58:24,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:58:24,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:58:24,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:58:24,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,201 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 03:58:24,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:24,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:24,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,247 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 03:58:24,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:58:24,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:58:24,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:58:24,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,289 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 03:58:24,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:24,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:24,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,333 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 03:58:24,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:58:24,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:58:24,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:58:24,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,367 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 03:58:24,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:58:24,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:58:24,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:58:24,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,399 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 03:58:24,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:24,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:24,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,439 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 03:58:24,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:58:24,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:58:24,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:58:24,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,467 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-13 03:58:24,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:58:24,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:58:24,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:58:24,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-13 03:58:24,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,500 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) [2022-07-13 03:58:24,501 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 [2022-07-13 03:58:24,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:58:24,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:58:24,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:58:24,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,537 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 [2022-07-13 03:58:24,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,542 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-13 03:58:24,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:58:24,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:58:24,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:58:24,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,569 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 03:58:24,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:58:24,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:58:24,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:58:24,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,598 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 03:58:24,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:24,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:24,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,633 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-13 03:58:24,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:58:24,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:58:24,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:58:24,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-13 03:58:24,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,660 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-13 03:58:24,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:24,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:24,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,701 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-13 03:58:24,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:24,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:24,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,747 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-13 03:58:24,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:24,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:24,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-13 03:58:24,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,785 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-13 03:58:24,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:24,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:24,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,828 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:24,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:24,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-13 03:58:24,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,874 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:24,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:24,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-13 03:58:24,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,918 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-13 03:58:24,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:24,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:24,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:24,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,957 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-13 03:58:24,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:24,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:58:24,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:24,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:24,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:24,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:58:24,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:58:24,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:24,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-13 03:58:24,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:24,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:24,991 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:24,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-13 03:58:24,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:24,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:25,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:25,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:25,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:25,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:25,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:25,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:25,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:25,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:25,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:25,032 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:25,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-13 03:58:25,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:25,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:25,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:25,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:25,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:25,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:25,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:25,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:58:25,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:25,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:25,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:25,068 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:25,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-13 03:58:25,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:58:25,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:58:25,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:58:25,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:58:25,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:58:25,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:58:25,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:58:25,096 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:58:25,122 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-07-13 03:58:25,123 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-13 03:58:25,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:25,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:25,130 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:58:25,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-13 03:58:25,132 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:58:25,139 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:58:25,139 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:58:25,139 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 9*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_1 - 2*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-13 03:58:25,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-13 03:58:25,188 INFO L293 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2022-07-13 03:58:25,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:58:25,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:58:25,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:58:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:58:25,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:58:25,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:58:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:58:25,298 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 03:58:25,299 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:58:25,340 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 80 transitions. Complement of second has 8 states. [2022-07-13 03:58:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 03:58:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:58:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-07-13 03:58:25,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-13 03:58:25,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:58:25,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-13 03:58:25,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:58:25,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-13 03:58:25,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:58:25,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 80 transitions. [2022-07-13 03:58:25,352 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-13 03:58:25,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 19 states and 28 transitions. [2022-07-13 03:58:25,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-13 03:58:25,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-13 03:58:25,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2022-07-13 03:58:25,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:58:25,357 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-07-13 03:58:25,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2022-07-13 03:58:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-13 03:58:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:58:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2022-07-13 03:58:25,377 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-07-13 03:58:25,377 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-07-13 03:58:25,378 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:58:25,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2022-07-13 03:58:25,378 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-13 03:58:25,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:58:25,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:58:25,379 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:58:25,379 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:58:25,379 INFO L752 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); 153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 162#L33-3 assume !(main_~i~0#1 < 5); 157#L33-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 158#L35 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 151#L37-3 [2022-07-13 03:58:25,379 INFO L754 eck$LassoCheckResult]: Loop: 151#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 150#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 151#L37-3 [2022-07-13 03:58:25,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:25,379 INFO L85 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2022-07-13 03:58:25,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:25,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813409367] [2022-07-13 03:58:25,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:25,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:58:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:58:25,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:58:25,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813409367] [2022-07-13 03:58:25,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813409367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:58:25,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:58:25,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:58:25,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002367645] [2022-07-13 03:58:25,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:58:25,416 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:58:25,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2022-07-13 03:58:25,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:25,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433471313] [2022-07-13 03:58:25,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:25,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:25,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:58:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:25,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:58:25,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:58:25,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:58:25,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:58:25,466 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:58:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:58:25,489 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-07-13 03:58:25,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:58:25,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2022-07-13 03:58:25,491 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-13 03:58:25,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2022-07-13 03:58:25,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-13 03:58:25,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-13 03:58:25,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2022-07-13 03:58:25,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:58:25,493 INFO L369 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-07-13 03:58:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2022-07-13 03:58:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-07-13 03:58:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:58:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-07-13 03:58:25,495 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-13 03:58:25,495 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-13 03:58:25,495 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:58:25,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-07-13 03:58:25,496 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-13 03:58:25,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:58:25,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:58:25,496 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:58:25,496 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:58:25,497 INFO L752 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); 202#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 211#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 209#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 210#L33-3 assume !(main_~i~0#1 < 5); 206#L33-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 207#L35 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 215#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 199#L37-2 [2022-07-13 03:58:25,497 INFO L754 eck$LassoCheckResult]: Loop: 199#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 200#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 199#L37-2 [2022-07-13 03:58:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2022-07-13 03:58:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:25,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698292179] [2022-07-13 03:58:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:58:25,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:58:25,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:58:25,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698292179] [2022-07-13 03:58:25,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698292179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:58:25,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054822505] [2022-07-13 03:58:25,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:25,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:58:25,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:25,524 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:58:25,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-13 03:58:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:58:25,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 03:58:25,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:58:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:58:25,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:58:25,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-13 03:58:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:58:25,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054822505] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:58:25,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:58:25,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-13 03:58:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982695874] [2022-07-13 03:58:25,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:58:25,622 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:58:25,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2022-07-13 03:58:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:25,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123895355] [2022-07-13 03:58:25,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:25,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:25,627 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:58:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:25,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:58:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:58:25,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:58:25,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:58:25,671 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:58:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:58:25,737 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-07-13 03:58:25,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:58:25,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2022-07-13 03:58:25,741 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-13 03:58:25,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2022-07-13 03:58:25,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-13 03:58:25,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-07-13 03:58:25,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2022-07-13 03:58:25,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:58:25,745 INFO L369 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-13 03:58:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2022-07-13 03:58:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-07-13 03:58:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:58:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-07-13 03:58:25,750 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-07-13 03:58:25,750 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-07-13 03:58:25,750 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:58:25,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2022-07-13 03:58:25,751 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-13 03:58:25,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:58:25,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:58:25,751 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2022-07-13 03:58:25,751 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:58:25,752 INFO L752 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); 314#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 323#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 328#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 329#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 321#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 322#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 335#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 334#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 331#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 330#L33-3 assume !(main_~i~0#1 < 5); 318#L33-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 319#L35 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 327#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 311#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 312#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 339#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 338#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 337#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 336#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 333#L37-2 [2022-07-13 03:58:25,752 INFO L754 eck$LassoCheckResult]: Loop: 333#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 332#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 333#L37-2 [2022-07-13 03:58:25,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:25,752 INFO L85 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 1 times [2022-07-13 03:58:25,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:25,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617318834] [2022-07-13 03:58:25,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:25,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:58:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 03:58:25,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:58:25,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617318834] [2022-07-13 03:58:25,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617318834] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:58:25,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692929752] [2022-07-13 03:58:25,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:25,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:58:25,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:25,812 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:58:25,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-13 03:58:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:58:25,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:58:25,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:58:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 03:58:25,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:58:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 03:58:25,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692929752] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:58:25,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:58:25,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-13 03:58:25,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219974361] [2022-07-13 03:58:25,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:58:25,926 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:58:25,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:25,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2022-07-13 03:58:25,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:25,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771865271] [2022-07-13 03:58:25,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:25,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:25,933 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:58:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:25,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:58:25,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:58:25,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 03:58:25,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-13 03:58:25,970 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:58:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:58:26,024 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-13 03:58:26,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 03:58:26,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2022-07-13 03:58:26,029 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-13 03:58:26,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2022-07-13 03:58:26,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-07-13 03:58:26,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-07-13 03:58:26,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2022-07-13 03:58:26,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:58:26,032 INFO L369 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-07-13 03:58:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2022-07-13 03:58:26,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-07-13 03:58:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:58:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-13 03:58:26,037 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-13 03:58:26,037 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-13 03:58:26,037 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:58:26,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2022-07-13 03:58:26,038 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-13 03:58:26,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:58:26,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:58:26,039 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2022-07-13 03:58:26,040 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:58:26,040 INFO L752 eck$LassoCheckResult]: Stem: 516#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); 517#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 526#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 531#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 532#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 524#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 525#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 542#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 540#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 538#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 537#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 534#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 533#L33-3 assume !(main_~i~0#1 < 5); 521#L33-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 522#L35 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 530#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 514#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 515#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 546#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 545#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 544#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 543#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 541#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 539#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 536#L37-2 [2022-07-13 03:58:26,040 INFO L754 eck$LassoCheckResult]: Loop: 536#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 535#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 536#L37-2 [2022-07-13 03:58:26,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:26,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 2 times [2022-07-13 03:58:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:26,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037247950] [2022-07-13 03:58:26,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:26,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:26,082 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:58:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:26,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:58:26,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:26,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2022-07-13 03:58:26,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:26,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388070007] [2022-07-13 03:58:26,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:26,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:26,122 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:58:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:26,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:58:26,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:26,124 INFO L85 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 3 times [2022-07-13 03:58:26,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:26,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636235903] [2022-07-13 03:58:26,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:26,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:58:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 03:58:26,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:58:26,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636235903] [2022-07-13 03:58:26,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636235903] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:58:26,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888210295] [2022-07-13 03:58:26,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 03:58:26,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:58:26,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:58:26,211 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:58:26,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-13 03:58:26,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 03:58:26,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:58:26,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:58:26,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:58:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 03:58:26,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:58:26,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888210295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:58:26,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 03:58:26,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-07-13 03:58:26,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067530270] [2022-07-13 03:58:26,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:58:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:58:26,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 03:58:26,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-07-13 03:58:26,334 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:58:26,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:58:26,413 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-07-13 03:58:26,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 03:58:26,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 57 transitions. [2022-07-13 03:58:26,416 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-13 03:58:26,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 57 transitions. [2022-07-13 03:58:26,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-13 03:58:26,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2022-07-13 03:58:26,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 57 transitions. [2022-07-13 03:58:26,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:58:26,417 INFO L369 hiAutomatonCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-07-13 03:58:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 57 transitions. [2022-07-13 03:58:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2022-07-13 03:58:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:58:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-07-13 03:58:26,422 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-07-13 03:58:26,422 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-07-13 03:58:26,422 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:58:26,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 39 transitions. [2022-07-13 03:58:26,424 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-13 03:58:26,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:58:26,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:58:26,425 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:58:26,425 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:58:26,425 INFO L752 eck$LassoCheckResult]: Stem: 689#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); 690#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 699#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 697#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 698#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 718#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 716#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 714#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 712#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 710#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 708#L33-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 706#L33-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 704#L33-3 assume !(main_~i~0#1 < 5); 694#L33-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 695#L35 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 703#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 687#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 688#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 719#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 717#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 715#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 713#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 711#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 709#L37-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 707#L37-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 705#L37-3 assume !(main_~i~0#1 < 5); 701#L37-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 702#L39 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 686#L42-3 [2022-07-13 03:58:26,425 INFO L754 eck$LassoCheckResult]: Loop: 686#L42-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 684#L42-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 686#L42-3 [2022-07-13 03:58:26,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:26,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2022-07-13 03:58:26,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:26,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482163643] [2022-07-13 03:58:26,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:26,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:26,457 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:58:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:26,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:58:26,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2022-07-13 03:58:26,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:26,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740390990] [2022-07-13 03:58:26,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:26,471 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:58:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:26,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:58:26,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:58:26,474 INFO L85 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2022-07-13 03:58:26,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:58:26,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178174726] [2022-07-13 03:58:26,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:58:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:58:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:26,501 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:58:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:58:26,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:58:30,448 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:58:30,448 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:58:30,448 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:58:30,448 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:58:30,448 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:58:30,448 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:58:30,448 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:58:30,448 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:58:30,448 INFO L133 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration6_Lasso [2022-07-13 03:58:30,449 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:58:30,449 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:58:30,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:30,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:30,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:30,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:30,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:30,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:58:31,304 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 03:58:31,307 INFO L158 Benchmark]: Toolchain (without parser) took 8982.92ms. Allocated memory was 113.2MB in the beginning and 184.5MB in the end (delta: 71.3MB). Free memory was 85.3MB in the beginning and 105.0MB in the end (delta: -19.7MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. [2022-07-13 03:58:31,308 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 67.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:58:31,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.73ms. Allocated memory is still 113.2MB. Free memory was 85.0MB in the beginning and 85.8MB in the end (delta: -799.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:58:31,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.12ms. Allocated memory is still 113.2MB. Free memory was 85.8MB in the beginning and 84.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:58:31,308 INFO L158 Benchmark]: Boogie Preprocessor took 35.10ms. Allocated memory is still 113.2MB. Free memory was 84.2MB in the beginning and 82.9MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 03:58:31,309 INFO L158 Benchmark]: RCFGBuilder took 287.37ms. Allocated memory is still 113.2MB. Free memory was 82.8MB in the beginning and 70.9MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 03:58:31,309 INFO L158 Benchmark]: BuchiAutomizer took 8371.38ms. Allocated memory was 113.2MB in the beginning and 184.5MB in the end (delta: 71.3MB). Free memory was 70.8MB in the beginning and 105.0MB in the end (delta: -34.2MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2022-07-13 03:58:31,310 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.16ms. Allocated memory is still 113.2MB. Free memory is still 67.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.73ms. Allocated memory is still 113.2MB. Free memory was 85.0MB in the beginning and 85.8MB in the end (delta: -799.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.12ms. Allocated memory is still 113.2MB. Free memory was 85.8MB in the beginning and 84.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.10ms. Allocated memory is still 113.2MB. Free memory was 84.2MB in the beginning and 82.9MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 287.37ms. Allocated memory is still 113.2MB. Free memory was 82.8MB in the beginning and 70.9MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 8371.38ms. Allocated memory was 113.2MB in the beginning and 184.5MB in the end (delta: 71.3MB). Free memory was 70.8MB in the beginning and 105.0MB in the end (delta: -34.2MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 03:58:31,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-07-13 03:58:31,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-07-13 03:58:31,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-13 03:58:31,949 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*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null