./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 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-3598765 [2022-07-22 02:18:17,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 02:18:17,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 02:18:17,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 02:18:17,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 02:18:17,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 02:18:17,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 02:18:17,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 02:18:17,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 02:18:17,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 02:18:17,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 02:18:17,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 02:18:17,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 02:18:17,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 02:18:17,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 02:18:17,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 02:18:17,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 02:18:17,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 02:18:17,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 02:18:17,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 02:18:17,496 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 02:18:17,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 02:18:17,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 02:18:17,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 02:18:17,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 02:18:17,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 02:18:17,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 02:18:17,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 02:18:17,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 02:18:17,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 02:18:17,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 02:18:17,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 02:18:17,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 02:18:17,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 02:18:17,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 02:18:17,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 02:18:17,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 02:18:17,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 02:18:17,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 02:18:17,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 02:18:17,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 02:18:17,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 02:18:17,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 02:18:17,554 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 02:18:17,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 02:18:17,555 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 02:18:17,555 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 02:18:17,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 02:18:17,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 02:18:17,557 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 02:18:17,557 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 02:18:17,558 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 02:18:17,558 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 02:18:17,559 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 02:18:17,559 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 02:18:17,559 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 02:18:17,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 02:18:17,559 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 02:18:17,560 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 02:18:17,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 02:18:17,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 02:18:17,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 02:18:17,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 02:18:17,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 02:18:17,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 02:18:17,561 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 02:18:17,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 02:18:17,562 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 02:18:17,562 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 02:18:17,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 02:18:17,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 02:18:17,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 02:18:17,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 02:18:17,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 02:18:17,565 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 02:18:17,565 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-22 02:18:17,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 02:18:17,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 02:18:17,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 02:18:17,877 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 02:18:17,878 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 02:18:17,879 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-22 02:18:17,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8829e86e5/903bbef16a92482c8920610009f99559/FLAG658acab3f [2022-07-22 02:18:18,327 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 02:18:18,332 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-1.i [2022-07-22 02:18:18,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8829e86e5/903bbef16a92482c8920610009f99559/FLAG658acab3f [2022-07-22 02:18:18,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8829e86e5/903bbef16a92482c8920610009f99559 [2022-07-22 02:18:18,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 02:18:18,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 02:18:18,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 02:18:18,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 02:18:18,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 02:18:18,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:18:18" (1/1) ... [2022-07-22 02:18:18,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f5fa4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:18, skipping insertion in model container [2022-07-22 02:18:18,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:18:18" (1/1) ... [2022-07-22 02:18:18,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 02:18:18,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 02:18:18,536 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-22 02:18:18,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:18:18,611 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 02:18:18,628 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-22 02:18:18,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:18:18,663 INFO L208 MainTranslator]: Completed translation [2022-07-22 02:18:18,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:18 WrapperNode [2022-07-22 02:18:18,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 02:18:18,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 02:18:18,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 02:18:18,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 02:18:18,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:18" (1/1) ... [2022-07-22 02:18:18,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:18" (1/1) ... [2022-07-22 02:18:18,711 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2022-07-22 02:18:18,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 02:18:18,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 02:18:18,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 02:18:18,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 02:18:18,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:18" (1/1) ... [2022-07-22 02:18:18,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:18" (1/1) ... [2022-07-22 02:18:18,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:18" (1/1) ... [2022-07-22 02:18:18,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:18" (1/1) ... [2022-07-22 02:18:18,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:18" (1/1) ... [2022-07-22 02:18:18,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:18" (1/1) ... [2022-07-22 02:18:18,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:18" (1/1) ... [2022-07-22 02:18:18,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 02:18:18,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 02:18:18,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 02:18:18,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 02:18:18,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:18" (1/1) ... [2022-07-22 02:18:18,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:18,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:18,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:18,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 02:18:18,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 02:18:18,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 02:18:18,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 02:18:18,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 02:18:18,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 02:18:18,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 02:18:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 02:18:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 02:18:18,888 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 02:18:18,889 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 02:18:19,106 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 02:18:19,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 02:18:19,111 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-22 02:18:19,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:18:19 BoogieIcfgContainer [2022-07-22 02:18:19,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 02:18:19,114 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 02:18:19,114 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 02:18:19,116 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 02:18:19,117 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:18:19,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 02:18:18" (1/3) ... [2022-07-22 02:18:19,118 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@248ff936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:18:19, skipping insertion in model container [2022-07-22 02:18:19,118 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:18:19,118 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:18:18" (2/3) ... [2022-07-22 02:18:19,118 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@248ff936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:18:19, skipping insertion in model container [2022-07-22 02:18:19,118 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:18:19,118 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:18:19" (3/3) ... [2022-07-22 02:18:19,119 INFO L354 chiAutomizerObserver]: Analyzing ICFG string-1.i [2022-07-22 02:18:19,166 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 02:18:19,179 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 02:18:19,179 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 02:18:19,179 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 02:18:19,180 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 02:18:19,180 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 02:18:19,180 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 02:18:19,180 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 02:18:19,184 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-22 02:18:19,210 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2022-07-22 02:18:19,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:19,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:19,226 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 02:18:19,226 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:19,226 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 02:18:19,227 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-22 02:18:19,229 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2022-07-22 02:18:19,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:19,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:19,239 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 02:18:19,240 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:19,247 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-22 02:18:19,255 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-22 02:18:19,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:19,261 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-22 02:18:19,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:19,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302810134] [2022-07-22 02:18:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:19,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:19,377 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:19,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:19,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:19,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-22 02:18:19,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:19,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439109691] [2022-07-22 02:18:19,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:19,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:19,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:19,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:19,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-22 02:18:19,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:19,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661470695] [2022-07-22 02:18:19,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:19,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:19,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:19,951 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:18:19,952 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:18:19,952 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:18:19,952 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:18:19,952 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:18:19,953 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:19,953 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:18:19,954 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:18:19,954 INFO L133 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration1_Lasso [2022-07-22 02:18:19,954 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:18:19,954 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:18:19,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:19,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:19,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:19,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:19,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:19,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:19,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:19,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:19,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:20,492 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:18:20,498 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:18:20,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:20,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:20,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:20,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 02:18:20,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:20,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:20,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:20,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:20,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:20,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:20,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:20,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:20,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:20,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 02:18:20,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:20,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:20,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:20,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 02:18:20,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:20,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:20,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:20,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:20,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:20,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:20,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:20,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:20,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:20,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:20,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:20,612 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:20,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 02:18:20,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:20,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:20,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:20,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:20,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:20,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:20,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:20,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:20,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:20,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:20,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:20,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:20,655 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:20,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 02:18:20,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:20,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:20,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:20,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:20,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:20,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:20,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:20,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:20,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:20,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:20,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:20,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:20,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 02:18:20,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:20,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:20,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:20,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:20,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:20,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:20,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:20,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:20,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:20,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:20,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:20,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:20,741 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:20,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 02:18:20,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:20,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:20,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:20,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:20,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:20,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:20,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:20,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:20,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:20,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:20,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:20,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:20,786 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:20,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 02:18:20,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:20,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:20,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:20,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:20,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:20,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:20,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:20,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:20,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-22 02:18:20,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:20,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:20,836 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:20,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:20,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 02:18:20,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:20,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:20,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:20,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:20,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:20,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:20,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:20,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:20,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:20,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:20,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:20,873 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:20,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 02:18:20,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:20,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:20,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:20,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:20,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:20,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:20,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:20,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:20,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:20,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:20,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:20,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:20,913 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-22 02:18:20,915 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-22 02:18:20,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:20,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:20,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:20,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:20,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:20,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:20,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:20,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:20,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:20,946 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-22 02:18:20,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:20,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:20,947 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:20,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 02:18:20,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:20,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:20,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:20,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:20,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:20,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:20,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:20,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:20,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:20,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:20,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:20,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:20,996 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:20,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 02:18:20,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:21,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:21,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:21,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:21,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:21,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-22 02:18:21,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,026 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:21,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:21,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:21,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 02:18:21,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:21,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:21,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,091 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:21,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:21,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 02:18:21,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:21,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:21,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:21,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:21,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,148 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 02:18:21,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:21,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:21,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:21,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:21,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:21,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,203 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 02:18:21,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:21,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:21,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:21,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:21,249 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-22 02:18:21,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,250 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 02:18:21,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:21,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:21,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:21,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:21,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:21,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,304 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 02:18:21,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:21,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:21,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:21,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:21,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:21,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,354 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 02:18:21,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:21,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:21,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:21,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:21,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:21,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,398 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 02:18:21,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-22 02:18:21,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:21,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:21,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:21,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:21,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,466 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:21,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:21,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:21,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 02:18:21,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:21,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:21,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,525 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:21,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:18:21,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:18:21,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:18:21,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 02:18:21,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:21,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:21,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,580 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 02:18:21,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:21,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:21,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:21,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:21,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:21,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,630 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 02:18:21,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:21,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:21,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:21,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:18:21,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-22 02:18:21,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,673 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 02:18:21,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:18:21,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:18:21,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:18:21,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:18:21,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:18:21,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:18:21,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:18:21,715 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:18:21,746 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-07-22 02:18:21,747 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-22 02:18:21,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:21,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:21,787 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:18:21,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 02:18:21,840 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:18:21,859 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 02:18:21,859 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:18:21,860 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-22 02:18:21,880 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-22 02:18:21,908 INFO L293 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2022-07-22 02:18:21,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:21,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:18:21,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:18:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:21,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 02:18:21,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:18:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:18:22,036 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 02:18:22,037 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-22 02:18:22,074 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-22 02:18:22,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 02:18:22,080 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-22 02:18:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-07-22 02:18:22,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 02:18:22,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:18:22,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 02:18:22,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:18:22,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-22 02:18:22,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:18:22,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 80 transitions. [2022-07-22 02:18:22,087 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:22,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 19 states and 28 transitions. [2022-07-22 02:18:22,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-22 02:18:22,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-22 02:18:22,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2022-07-22 02:18:22,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:18:22,091 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-07-22 02:18:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2022-07-22 02:18:22,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-22 02:18:22,109 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-22 02:18:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2022-07-22 02:18:22,111 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-07-22 02:18:22,111 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-07-22 02:18:22,111 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 02:18:22,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2022-07-22 02:18:22,112 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:22,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:22,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:22,112 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 02:18:22,112 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:22,112 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-22 02:18:22,112 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-22 02:18:22,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2022-07-22 02:18:22,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:22,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33304292] [2022-07-22 02:18:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:18:22,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:18:22,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33304292] [2022-07-22 02:18:22,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33304292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:18:22,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:18:22,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:18:22,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953639548] [2022-07-22 02:18:22,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:18:22,176 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:18:22,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:22,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2022-07-22 02:18:22,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:22,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067079624] [2022-07-22 02:18:22,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,195 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:22,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:18:22,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:18:22,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:18:22,244 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-22 02:18:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:18:22,269 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-07-22 02:18:22,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:18:22,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2022-07-22 02:18:22,274 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:22,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2022-07-22 02:18:22,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-22 02:18:22,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-22 02:18:22,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2022-07-22 02:18:22,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:18:22,291 INFO L369 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-07-22 02:18:22,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2022-07-22 02:18:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-07-22 02:18:22,293 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-22 02:18:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-07-22 02:18:22,293 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-22 02:18:22,293 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-22 02:18:22,293 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 02:18:22,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-07-22 02:18:22,294 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:22,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:22,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:22,295 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:18:22,295 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:22,295 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-22 02:18:22,295 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-22 02:18:22,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:22,295 INFO L85 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2022-07-22 02:18:22,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:22,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969184546] [2022-07-22 02:18:22,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:22,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:18:22,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:18:22,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969184546] [2022-07-22 02:18:22,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969184546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 02:18:22,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431285617] [2022-07-22 02:18:22,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:18:22,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:22,347 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-22 02:18:22,348 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-22 02:18:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:22,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 02:18:22,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:18:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:18:22,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 02:18:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:18:22,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431285617] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 02:18:22,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 02:18:22,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-22 02:18:22,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702180368] [2022-07-22 02:18:22,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 02:18:22,421 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:18:22,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:22,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2022-07-22 02:18:22,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:22,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111791946] [2022-07-22 02:18:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:22,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:18:22,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 02:18:22,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 02:18:22,481 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-22 02:18:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:18:22,543 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-07-22 02:18:22,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 02:18:22,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2022-07-22 02:18:22,547 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:22,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2022-07-22 02:18:22,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 02:18:22,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-07-22 02:18:22,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2022-07-22 02:18:22,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:18:22,548 INFO L369 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-22 02:18:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2022-07-22 02:18:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-07-22 02:18:22,551 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-22 02:18:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-07-22 02:18:22,552 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-07-22 02:18:22,552 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-07-22 02:18:22,552 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 02:18:22,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2022-07-22 02:18:22,552 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:22,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:22,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:22,553 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2022-07-22 02:18:22,553 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:22,553 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-22 02:18:22,553 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-22 02:18:22,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:22,553 INFO L85 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 1 times [2022-07-22 02:18:22,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:22,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905925900] [2022-07-22 02:18:22,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:22,619 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-22 02:18:22,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:18:22,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905925900] [2022-07-22 02:18:22,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905925900] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 02:18:22,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886653663] [2022-07-22 02:18:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:18:22,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:22,621 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-22 02:18:22,623 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-22 02:18:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:22,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 02:18:22,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:18:22,719 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-22 02:18:22,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 02:18:22,744 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-22 02:18:22,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886653663] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 02:18:22,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 02:18:22,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-22 02:18:22,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992974191] [2022-07-22 02:18:22,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 02:18:22,745 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:18:22,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2022-07-22 02:18:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:22,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770668912] [2022-07-22 02:18:22,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,753 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:18:22,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 02:18:22,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-22 02:18:22,789 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-22 02:18:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:18:22,847 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-22 02:18:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 02:18:22,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2022-07-22 02:18:22,849 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:22,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2022-07-22 02:18:22,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-07-22 02:18:22,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-07-22 02:18:22,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2022-07-22 02:18:22,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:18:22,850 INFO L369 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-07-22 02:18:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2022-07-22 02:18:22,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-07-22 02:18:22,852 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-22 02:18:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-22 02:18:22,853 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-22 02:18:22,853 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-22 02:18:22,853 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 02:18:22,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2022-07-22 02:18:22,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:22,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:22,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:22,854 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2022-07-22 02:18:22,854 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:22,854 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-22 02:18:22,854 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-22 02:18:22,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 2 times [2022-07-22 02:18:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:22,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070014704] [2022-07-22 02:18:22,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,900 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:22,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:22,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2022-07-22 02:18:22,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:22,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233687924] [2022-07-22 02:18:22,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,943 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:22,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:22,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:22,948 INFO L85 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 3 times [2022-07-22 02:18:22,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:22,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752740684] [2022-07-22 02:18:22,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:22,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:18:23,041 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-22 02:18:23,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:18:23,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752740684] [2022-07-22 02:18:23,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752740684] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 02:18:23,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621185681] [2022-07-22 02:18:23,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 02:18:23,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:18:23,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:18:23,047 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 02:18:23,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-22 02:18:23,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-22 02:18:23,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 02:18:23,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 02:18:23,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:18:23,162 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-22 02:18:23,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 02:18:23,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621185681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:18:23,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 02:18:23,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-07-22 02:18:23,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706358] [2022-07-22 02:18:23,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:18:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:18:23,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 02:18:23,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-07-22 02:18:23,198 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-22 02:18:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:18:23,281 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-07-22 02:18:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 02:18:23,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 57 transitions. [2022-07-22 02:18:23,283 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 02:18:23,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 57 transitions. [2022-07-22 02:18:23,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-22 02:18:23,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2022-07-22 02:18:23,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 57 transitions. [2022-07-22 02:18:23,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:18:23,284 INFO L369 hiAutomatonCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-07-22 02:18:23,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 57 transitions. [2022-07-22 02:18:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2022-07-22 02:18:23,286 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-22 02:18:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-07-22 02:18:23,286 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-07-22 02:18:23,287 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-07-22 02:18:23,287 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 02:18:23,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 39 transitions. [2022-07-22 02:18:23,287 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-22 02:18:23,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:18:23,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:18:23,288 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:18:23,288 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:18:23,288 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-22 02:18:23,288 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-22 02:18:23,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:23,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2022-07-22 02:18:23,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:23,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523184006] [2022-07-22 02:18:23,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:23,320 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:23,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:23,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2022-07-22 02:18:23,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:23,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074998236] [2022-07-22 02:18:23,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:23,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:23,363 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:23,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:23,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:18:23,366 INFO L85 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2022-07-22 02:18:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:18:23,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192866362] [2022-07-22 02:18:23,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:18:23,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:18:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:23,416 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:18:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:18:23,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:18:27,588 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:18:27,588 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:18:27,588 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:18:27,588 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:18:27,588 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:18:27,588 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:18:27,588 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:18:27,589 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:18:27,589 INFO L133 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration6_Lasso [2022-07-22 02:18:27,589 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:18:27,589 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:18:27,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:27,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:27,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:27,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:27,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:27,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:18:28,591 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-22 02:18:28,593 INFO L158 Benchmark]: Toolchain (without parser) took 10229.52ms. Allocated memory was 56.6MB in the beginning and 104.9MB in the end (delta: 48.2MB). Free memory was 36.0MB in the beginning and 66.8MB in the end (delta: -30.8MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2022-07-22 02:18:28,594 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:18:28,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.29ms. Allocated memory is still 56.6MB. Free memory was 35.8MB in the beginning and 39.8MB in the end (delta: -4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 02:18:28,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.45ms. Allocated memory is still 56.6MB. Free memory was 39.6MB in the beginning and 38.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:18:28,594 INFO L158 Benchmark]: Boogie Preprocessor took 42.55ms. Allocated memory is still 56.6MB. Free memory was 38.0MB in the beginning and 36.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:18:28,594 INFO L158 Benchmark]: RCFGBuilder took 357.29ms. Allocated memory is still 56.6MB. Free memory was 36.6MB in the beginning and 24.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 02:18:28,595 INFO L158 Benchmark]: BuchiAutomizer took 9478.69ms. Allocated memory was 56.6MB in the beginning and 104.9MB in the end (delta: 48.2MB). Free memory was 24.7MB in the beginning and 66.8MB in the end (delta: -42.1MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2022-07-22 02:18:28,596 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.17ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.29ms. Allocated memory is still 56.6MB. Free memory was 35.8MB in the beginning and 39.8MB in the end (delta: -4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.45ms. Allocated memory is still 56.6MB. Free memory was 39.6MB in the beginning and 38.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.55ms. Allocated memory is still 56.6MB. Free memory was 38.0MB in the beginning and 36.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 357.29ms. Allocated memory is still 56.6MB. Free memory was 36.6MB in the beginning and 24.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 9478.69ms. Allocated memory was 56.6MB in the beginning and 104.9MB in the end (delta: 48.2MB). Free memory was 24.7MB in the beginning and 66.8MB in the end (delta: -42.1MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 02:18:28,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:28,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-22 02:18:29,043 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-22 02:18:29,244 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