./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 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/array-memsafety/openbsd_cstrstr-alloca-2.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 991fb09b573d5827d0db553f1ea89a581f5a664ba8b68d6f14a043df738f2f6d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 22:50:13,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 22:50:13,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 22:50:13,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 22:50:13,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 22:50:13,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 22:50:13,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 22:50:13,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 22:50:13,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 22:50:13,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 22:50:13,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 22:50:13,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 22:50:13,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 22:50:13,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 22:50:13,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 22:50:13,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 22:50:13,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 22:50:13,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 22:50:13,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 22:50:13,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 22:50:13,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 22:50:13,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 22:50:13,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 22:50:13,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 22:50:13,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 22:50:13,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 22:50:13,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 22:50:13,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 22:50:13,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 22:50:13,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 22:50:13,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 22:50:13,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 22:50:13,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 22:50:13,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 22:50:13,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 22:50:13,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 22:50:13,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 22:50:13,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 22:50:13,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 22:50:13,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 22:50:13,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 22:50:13,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-21 22:50:14,018 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 22:50:14,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 22:50:14,019 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 22:50:14,019 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 22:50:14,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 22:50:14,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 22:50:14,021 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 22:50:14,022 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 22:50:14,022 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 22:50:14,022 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 22:50:14,023 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 22:50:14,023 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 22:50:14,023 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 22:50:14,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 22:50:14,023 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 22:50:14,023 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 22:50:14,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 22:50:14,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 22:50:14,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 22:50:14,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 22:50:14,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 22:50:14,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 22:50:14,024 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 22:50:14,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 22:50:14,026 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 22:50:14,026 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 22:50:14,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 22:50:14,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 22:50:14,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 22:50:14,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 22:50:14,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 22:50:14,027 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 22:50:14,028 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 22:50:14,028 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 -> 991fb09b573d5827d0db553f1ea89a581f5a664ba8b68d6f14a043df738f2f6d [2021-12-21 22:50:14,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 22:50:14,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 22:50:14,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 22:50:14,265 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 22:50:14,265 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 22:50:14,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2021-12-21 22:50:14,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aef6293c/2d5a1bb8d5ce414f9da79b9e16663ab2/FLAG7f2c31d1a [2021-12-21 22:50:14,690 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 22:50:14,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2021-12-21 22:50:14,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aef6293c/2d5a1bb8d5ce414f9da79b9e16663ab2/FLAG7f2c31d1a [2021-12-21 22:50:15,068 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aef6293c/2d5a1bb8d5ce414f9da79b9e16663ab2 [2021-12-21 22:50:15,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 22:50:15,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 22:50:15,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 22:50:15,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 22:50:15,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 22:50:15,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:50:15" (1/1) ... [2021-12-21 22:50:15,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5899f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:15, skipping insertion in model container [2021-12-21 22:50:15,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:50:15" (1/1) ... [2021-12-21 22:50:15,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 22:50:15,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 22:50:15,368 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:50:15,374 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 22:50:15,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:50:15,436 INFO L208 MainTranslator]: Completed translation [2021-12-21 22:50:15,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:15 WrapperNode [2021-12-21 22:50:15,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 22:50:15,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 22:50:15,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 22:50:15,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 22:50:15,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:15" (1/1) ... [2021-12-21 22:50:15,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:15" (1/1) ... [2021-12-21 22:50:15,481 INFO L137 Inliner]: procedures = 119, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 156 [2021-12-21 22:50:15,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 22:50:15,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 22:50:15,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 22:50:15,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 22:50:15,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:15" (1/1) ... [2021-12-21 22:50:15,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:15" (1/1) ... [2021-12-21 22:50:15,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:15" (1/1) ... [2021-12-21 22:50:15,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:15" (1/1) ... [2021-12-21 22:50:15,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:15" (1/1) ... [2021-12-21 22:50:15,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:15" (1/1) ... [2021-12-21 22:50:15,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:15" (1/1) ... [2021-12-21 22:50:15,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 22:50:15,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 22:50:15,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 22:50:15,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 22:50:15,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:15" (1/1) ... [2021-12-21 22:50:15,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:15,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:15,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:15,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-21 22:50:15,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 22:50:15,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 22:50:15,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 22:50:15,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 22:50:15,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 22:50:15,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 22:50:15,769 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 22:50:15,788 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 22:50:16,004 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 22:50:16,008 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 22:50:16,008 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-21 22:50:16,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:50:16 BoogieIcfgContainer [2021-12-21 22:50:16,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 22:50:16,010 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 22:50:16,010 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 22:50:16,014 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 22:50:16,014 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:50:16,014 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 10:50:15" (1/3) ... [2021-12-21 22:50:16,015 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@782679a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:50:16, skipping insertion in model container [2021-12-21 22:50:16,016 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:50:16,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:15" (2/3) ... [2021-12-21 22:50:16,016 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@782679a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:50:16, skipping insertion in model container [2021-12-21 22:50:16,016 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:50:16,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:50:16" (3/3) ... [2021-12-21 22:50:16,017 INFO L388 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca-2.i [2021-12-21 22:50:16,052 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 22:50:16,052 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 22:50:16,052 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 22:50:16,052 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 22:50:16,052 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 22:50:16,053 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 22:50:16,053 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 22:50:16,053 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 22:50:16,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:16,078 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2021-12-21 22:50:16,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:16,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:16,082 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-21 22:50:16,082 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:16,082 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 22:50:16,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:16,087 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2021-12-21 22:50:16,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:16,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:16,088 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-21 22:50:16,088 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:16,092 INFO L791 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 32#L555true assume !(main_~length1~0#1 < 1); 29#L555-2true assume !(main_~length2~0#1 < 1); 7#L558-1true call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 36#L564-3true [2021-12-21 22:50:16,093 INFO L793 eck$LassoCheckResult]: Loop: 36#L564-3true assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 24#L564-2true main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 36#L564-3true [2021-12-21 22:50:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2021-12-21 22:50:16,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:16,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784782504] [2021-12-21 22:50:16,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:16,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:16,170 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:16,205 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2021-12-21 22:50:16,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:16,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606882266] [2021-12-21 22:50:16,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:16,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:16,224 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:16,235 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:16,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2021-12-21 22:50:16,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:16,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126857082] [2021-12-21 22:50:16,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:16,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:16,304 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:16,316 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:16,620 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:50:16,621 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:50:16,621 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:50:16,621 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:50:16,621 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:50:16,621 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:16,622 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:50:16,622 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:50:16,622 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration1_Lasso [2021-12-21 22:50:16,622 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:50:16,622 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:50:16,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:16,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:17,006 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:50:17,009 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:50:17,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-21 22:50:17,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:17,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:17,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:17,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:17,071 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-21 22:50:17,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:17,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:17,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:17,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-21 22:50:17,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:17,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:17,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:17,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:17,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-21 22:50:17,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:17,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:17,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:17,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:17,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-21 22:50:17,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:17,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:17,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:17,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:17,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,319 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-21 22:50:17,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:17,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:17,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:17,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:17,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,353 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-21 22:50:17,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:17,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:17,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:17,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,398 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-21 22:50:17,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:17,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:17,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:17,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:17,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,431 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-21 22:50:17,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:17,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:17,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:17,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,475 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-21 22:50:17,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:17,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:17,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:17,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:17,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,508 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-21 22:50:17,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:17,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:17,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-12-21 22:50:17,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,553 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-21 22:50:17,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:17,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:17,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:17,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:17,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,588 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-21 22:50:17,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:17,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:17,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-12-21 22:50:17,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,631 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-21 22:50:17,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 [2021-12-21 22:50:17,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:17,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:17,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:17,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:17,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,660 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-21 22:50:17,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:17,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:17,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:17,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:17,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,702 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-21 22:50:17,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:17,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:17,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:17,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:17,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:17,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:17,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:17,732 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:50:17,759 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-12-21 22:50:17,760 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-12-21 22:50:17,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:17,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,762 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,785 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:50:17,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-21 22:50:17,807 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-21 22:50:17,807 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:50:17,808 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length1~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-21 22:50:17,846 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 [2021-12-21 22:50:17,858 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-12-21 22:50:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:17,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 22:50:17,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:17,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 22:50:17,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:50:17,938 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-21 22:50:17,939 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:17,977 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 99 states and 145 transitions. Complement of second has 7 states. [2021-12-21 22:50:17,979 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 [2021-12-21 22:50:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2021-12-21 22:50:17,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 2 letters. [2021-12-21 22:50:17,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:17,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 7 letters. Loop has 2 letters. [2021-12-21 22:50:17,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:17,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 4 letters. [2021-12-21 22:50:17,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:17,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 145 transitions. [2021-12-21 22:50:17,988 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2021-12-21 22:50:17,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 32 states and 43 transitions. [2021-12-21 22:50:17,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-12-21 22:50:17,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-21 22:50:17,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2021-12-21 22:50:17,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:17,992 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2021-12-21 22:50:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2021-12-21 22:50:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-21 22:50:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2021-12-21 22:50:18,008 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2021-12-21 22:50:18,008 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2021-12-21 22:50:18,008 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 22:50:18,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2021-12-21 22:50:18,009 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2021-12-21 22:50:18,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:18,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:18,009 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:18,009 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:18,009 INFO L791 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 221#L555 assume !(main_~length1~0#1 < 1); 238#L555-2 assume !(main_~length2~0#1 < 1); 216#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 217#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 237#L564-4 main_~i~1#1 := 0; 229#L568-3 [2021-12-21 22:50:18,010 INFO L793 eck$LassoCheckResult]: Loop: 229#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 231#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 229#L568-3 [2021-12-21 22:50:18,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:18,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2021-12-21 22:50:18,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:18,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974992575] [2021-12-21 22:50:18,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:18,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:50:18,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:18,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974992575] [2021-12-21 22:50:18,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974992575] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:50:18,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:50:18,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 22:50:18,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574027024] [2021-12-21 22:50:18,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:50:18,049 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:50:18,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:18,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2021-12-21 22:50:18,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:18,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50217564] [2021-12-21 22:50:18,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:18,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:18,054 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:18,057 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:18,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:18,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:50:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:50:18,087 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:18,106 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2021-12-21 22:50:18,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 22:50:18,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2021-12-21 22:50:18,107 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2021-12-21 22:50:18,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2021-12-21 22:50:18,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-21 22:50:18,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-21 22:50:18,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2021-12-21 22:50:18,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:18,108 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2021-12-21 22:50:18,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2021-12-21 22:50:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-12-21 22:50:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2021-12-21 22:50:18,110 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2021-12-21 22:50:18,110 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2021-12-21 22:50:18,110 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 22:50:18,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2021-12-21 22:50:18,111 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2021-12-21 22:50:18,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:18,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:18,111 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:18,112 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:18,112 INFO L791 eck$LassoCheckResult]: Stem: 308#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 292#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 293#L555 assume !(main_~length1~0#1 < 1); 310#L555-2 assume !(main_~length2~0#1 < 1); 288#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 289#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 305#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 306#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 309#L564-4 main_~i~1#1 := 0; 300#L568-3 [2021-12-21 22:50:18,112 INFO L793 eck$LassoCheckResult]: Loop: 300#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 302#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 300#L568-3 [2021-12-21 22:50:18,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:18,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2021-12-21 22:50:18,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:18,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704526174] [2021-12-21 22:50:18,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:18,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:18,121 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:18,129 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:18,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2021-12-21 22:50:18,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:18,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443929437] [2021-12-21 22:50:18,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:18,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:18,133 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:18,136 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:18,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2021-12-21 22:50:18,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:18,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994574637] [2021-12-21 22:50:18,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:18,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:18,179 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:18,190 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:18,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:18,459 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:50:18,459 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:50:18,459 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:50:18,459 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:50:18,459 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:50:18,459 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:18,459 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:50:18,459 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:50:18,459 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration3_Lasso [2021-12-21 22:50:18,459 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:50:18,459 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:50:18,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:18,866 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:50:18,866 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:50:18,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:18,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:18,868 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:18,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-21 22:50:18,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:18,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:18,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:18,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:18,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:18,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:18,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:18,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:18,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:18,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:18,924 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:18,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:18,925 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:18,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-21 22:50:18,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:18,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:18,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:18,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:18,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:18,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:18,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:18,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:18,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:18,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:18,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:18,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:18,976 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:18,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-21 22:50:18,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:18,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:18,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:18,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:18,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:18,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:18,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:19,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:19,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:19,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:19,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:19,036 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:19,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-21 22:50:19,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:19,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:19,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:19,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:19,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:19,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:19,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:19,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:19,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-21 22:50:19,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:19,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:19,099 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:19,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-21 22:50:19,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:19,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:19,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:19,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:19,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:19,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:19,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:19,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:19,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:19,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:19,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:19,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:19,143 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:19,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-21 22:50:19,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:19,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:19,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:19,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:19,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:19,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:19,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:19,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:19,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:19,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:19,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:19,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:19,193 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:19,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-21 22:50:19,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:19,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:19,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:19,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:19,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:19,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:19,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:19,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:19,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:19,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:19,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:19,239 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:19,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-21 22:50:19,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:19,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:19,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:19,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:19,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:19,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:19,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:19,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:19,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:19,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:19,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:19,282 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:19,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-21 22:50:19,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:19,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:19,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:19,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:19,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:19,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:19,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:19,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:19,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:19,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:19,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:19,326 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:19,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-21 22:50:19,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:19,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:19,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:19,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:19,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:19,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:19,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:19,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:19,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:19,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-21 22:50:19,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:19,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:19,366 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:19,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-21 22:50:19,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:19,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:19,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:19,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:19,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:19,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:19,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:19,404 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:50:19,422 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-12-21 22:50:19,422 INFO L444 ModelExtractionUtils]: 9 out of 37 variables were initially zero. Simplification set additionally 25 variables to zero. [2021-12-21 22:50:19,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:19,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:19,424 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:19,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-21 22:50:19,426 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:50:19,447 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-21 22:50:19,447 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:50:19,447 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2021-12-21 22:50:19,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:19,481 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2021-12-21 22:50:19,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:19,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 22:50:19,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:19,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 22:50:19,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:50:19,536 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-21 22:50:19,536 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:19,550 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 55 states and 75 transitions. Complement of second has 6 states. [2021-12-21 22:50:19,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 22:50:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2021-12-21 22:50:19,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 2 letters. [2021-12-21 22:50:19,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:19,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 11 letters. Loop has 2 letters. [2021-12-21 22:50:19,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:19,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 4 letters. [2021-12-21 22:50:19,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:19,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 75 transitions. [2021-12-21 22:50:19,552 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-12-21 22:50:19,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 33 states and 44 transitions. [2021-12-21 22:50:19,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-12-21 22:50:19,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-12-21 22:50:19,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2021-12-21 22:50:19,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:19,553 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-12-21 22:50:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2021-12-21 22:50:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-12-21 22:50:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2021-12-21 22:50:19,560 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-12-21 22:50:19,560 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-12-21 22:50:19,560 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 22:50:19,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2021-12-21 22:50:19,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-12-21 22:50:19,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:19,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:19,561 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:19,561 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:50:19,561 INFO L791 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 471#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 472#L555 assume !(main_~length1~0#1 < 1); 490#L555-2 assume !(main_~length2~0#1 < 1); 465#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 466#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 485#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 486#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 489#L564-4 main_~i~1#1 := 0; 479#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 480#L568-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 487#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 477#L518-4 [2021-12-21 22:50:19,561 INFO L793 eck$LassoCheckResult]: Loop: 477#L518-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 478#L518-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 491#L518-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 477#L518-4 [2021-12-21 22:50:19,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:19,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1351083894, now seen corresponding path program 1 times [2021-12-21 22:50:19,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:19,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033983359] [2021-12-21 22:50:19,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:19,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:19,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:19,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033983359] [2021-12-21 22:50:19,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033983359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:50:19,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:50:19,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 22:50:19,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070259288] [2021-12-21 22:50:19,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:50:19,624 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:50:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 1 times [2021-12-21 22:50:19,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:19,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839922097] [2021-12-21 22:50:19,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:19,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:19,627 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:19,629 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:19,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:19,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 22:50:19,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-21 22:50:19,654 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:19,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:19,671 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2021-12-21 22:50:19,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:50:19,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2021-12-21 22:50:19,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-12-21 22:50:19,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 44 transitions. [2021-12-21 22:50:19,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-12-21 22:50:19,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-12-21 22:50:19,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2021-12-21 22:50:19,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:19,673 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-12-21 22:50:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2021-12-21 22:50:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-21 22:50:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2021-12-21 22:50:19,674 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2021-12-21 22:50:19,674 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2021-12-21 22:50:19,674 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 22:50:19,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2021-12-21 22:50:19,674 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-12-21 22:50:19,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:19,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:19,675 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:19,675 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:50:19,675 INFO L791 eck$LassoCheckResult]: Stem: 563#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 547#L555 assume !(main_~length1~0#1 < 1); 565#L555-2 assume !(main_~length2~0#1 < 1); 542#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 543#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 560#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 561#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 564#L564-4 main_~i~1#1 := 0; 555#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 556#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 557#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 558#L568-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 562#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 552#L518-4 [2021-12-21 22:50:19,675 INFO L793 eck$LassoCheckResult]: Loop: 552#L518-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 553#L518-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 566#L518-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 552#L518-4 [2021-12-21 22:50:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:19,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1313217428, now seen corresponding path program 1 times [2021-12-21 22:50:19,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:19,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322176378] [2021-12-21 22:50:19,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:19,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:19,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:19,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:19,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322176378] [2021-12-21 22:50:19,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322176378] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:50:19,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627074090] [2021-12-21 22:50:19,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:19,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:50:19,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:19,786 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:50:19,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-12-21 22:50:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:19,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-21 22:50:19,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:20,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-12-21 22:50:20,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 22:50:20,027 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 22:50:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:20,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:50:20,070 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-12-21 22:50:20,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-21 22:50:20,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2021-12-21 22:50:20,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:20,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627074090] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:50:20,311 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:50:20,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2021-12-21 22:50:20,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487459961] [2021-12-21 22:50:20,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:50:20,311 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:50:20,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 2 times [2021-12-21 22:50:20,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:20,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750657632] [2021-12-21 22:50:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:20,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:20,315 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:20,317 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:20,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-21 22:50:20,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-12-21 22:50:20,341 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:20,466 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2021-12-21 22:50:20,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 22:50:20,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2021-12-21 22:50:20,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-12-21 22:50:20,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 46 transitions. [2021-12-21 22:50:20,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-12-21 22:50:20,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-12-21 22:50:20,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2021-12-21 22:50:20,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:20,468 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2021-12-21 22:50:20,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2021-12-21 22:50:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2021-12-21 22:50:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2021-12-21 22:50:20,469 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2021-12-21 22:50:20,469 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2021-12-21 22:50:20,469 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-21 22:50:20,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2021-12-21 22:50:20,470 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-12-21 22:50:20,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:20,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:20,470 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:20,470 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:50:20,470 INFO L791 eck$LassoCheckResult]: Stem: 742#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 724#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 725#L555 assume !(main_~length1~0#1 < 1); 744#L555-2 assume !(main_~length2~0#1 < 1); 718#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 719#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 738#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 739#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 743#L564-4 main_~i~1#1 := 0; 732#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 733#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 734#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 735#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 746#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 740#L568-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 741#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 730#L518-4 [2021-12-21 22:50:20,470 INFO L793 eck$LassoCheckResult]: Loop: 730#L518-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 731#L518-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 745#L518-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 730#L518-4 [2021-12-21 22:50:20,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:20,471 INFO L85 PathProgramCache]: Analyzing trace with hash -716718030, now seen corresponding path program 2 times [2021-12-21 22:50:20,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:20,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950320897] [2021-12-21 22:50:20,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:20,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:20,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:20,497 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:20,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 3 times [2021-12-21 22:50:20,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:20,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155240802] [2021-12-21 22:50:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:20,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:20,501 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:20,503 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1464353502, now seen corresponding path program 1 times [2021-12-21 22:50:20,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:20,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435426823] [2021-12-21 22:50:20,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:20,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:20,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:20,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435426823] [2021-12-21 22:50:20,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435426823] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:50:20,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496979424] [2021-12-21 22:50:20,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:20,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:50:20,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:20,699 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:50:20,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-12-21 22:50:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:20,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-21 22:50:20,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:20,912 INFO L353 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2021-12-21 22:50:20,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 57 [2021-12-21 22:50:20,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2021-12-21 22:50:20,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2021-12-21 22:50:21,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-21 22:50:21,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 3 [2021-12-21 22:50:21,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2021-12-21 22:50:21,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 22:50:21,085 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 22:50:21,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-21 22:50:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:21,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:50:21,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-21 22:50:21,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2021-12-21 22:50:21,118 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2021-12-21 22:50:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:21,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496979424] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:50:21,303 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:50:21,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2021-12-21 22:50:21,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235615800] [2021-12-21 22:50:21,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:50:21,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:21,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 22:50:21,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2021-12-21 22:50:21,333 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:21,698 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2021-12-21 22:50:21,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 22:50:21,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 74 transitions. [2021-12-21 22:50:21,700 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2021-12-21 22:50:21,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 74 transitions. [2021-12-21 22:50:21,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2021-12-21 22:50:21,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2021-12-21 22:50:21,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 74 transitions. [2021-12-21 22:50:21,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:21,701 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2021-12-21 22:50:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 74 transitions. [2021-12-21 22:50:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2021-12-21 22:50:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2021-12-21 22:50:21,703 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2021-12-21 22:50:21,703 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2021-12-21 22:50:21,703 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-21 22:50:21,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 52 transitions. [2021-12-21 22:50:21,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-12-21 22:50:21,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:21,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:21,703 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:21,703 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:50:21,703 INFO L791 eck$LassoCheckResult]: Stem: 992#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 974#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 975#L555 assume !(main_~length1~0#1 < 1); 994#L555-2 assume !(main_~length2~0#1 < 1); 970#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 971#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 989#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 990#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 993#L564-4 main_~i~1#1 := 0; 982#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 983#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 1002#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 1001#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 1000#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 986#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 984#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 985#L568-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 991#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 980#L518-4 [2021-12-21 22:50:21,703 INFO L793 eck$LassoCheckResult]: Loop: 980#L518-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 981#L518-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 995#L518-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 980#L518-4 [2021-12-21 22:50:21,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:21,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1569540784, now seen corresponding path program 3 times [2021-12-21 22:50:21,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:21,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479299576] [2021-12-21 22:50:21,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:21,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:21,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:21,748 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:21,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:21,749 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 4 times [2021-12-21 22:50:21,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:21,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656423090] [2021-12-21 22:50:21,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:21,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:21,751 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:21,760 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:21,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1119505220, now seen corresponding path program 2 times [2021-12-21 22:50:21,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:21,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639906236] [2021-12-21 22:50:21,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:21,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:21,774 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:21,784 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:23,451 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:50:23,451 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:50:23,451 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:50:23,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:50:23,451 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:50:23,451 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:23,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:50:23,451 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:50:23,451 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration7_Lasso [2021-12-21 22:50:23,451 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:50:23,452 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:50:23,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:23,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:24,123 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-21 22:50:24,125 INFO L158 Benchmark]: Toolchain (without parser) took 9054.47ms. Allocated memory was 94.4MB in the beginning and 159.4MB in the end (delta: 65.0MB). Free memory was 67.9MB in the beginning and 58.1MB in the end (delta: 9.8MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. [2021-12-21 22:50:24,126 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 94.4MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 22:50:24,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.94ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 67.7MB in the beginning and 102.6MB in the end (delta: -34.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 22:50:24,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.03ms. Allocated memory is still 132.1MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 22:50:24,126 INFO L158 Benchmark]: Boogie Preprocessor took 43.92ms. Allocated memory is still 132.1MB. Free memory was 100.5MB in the beginning and 98.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 22:50:24,126 INFO L158 Benchmark]: RCFGBuilder took 483.18ms. Allocated memory is still 132.1MB. Free memory was 98.8MB in the beginning and 84.7MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-21 22:50:24,127 INFO L158 Benchmark]: BuchiAutomizer took 8115.07ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 84.7MB in the beginning and 58.1MB in the end (delta: 26.6MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2021-12-21 22:50:24,128 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.13ms. Allocated memory is still 94.4MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.94ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 67.7MB in the beginning and 102.6MB in the end (delta: -34.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.03ms. Allocated memory is still 132.1MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.92ms. Allocated memory is still 132.1MB. Free memory was 100.5MB in the beginning and 98.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 483.18ms. Allocated memory is still 132.1MB. Free memory was 98.8MB in the beginning and 84.7MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 8115.07ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 84.7MB in the beginning and 58.1MB in the end (delta: 26.6MB). Peak memory consumption was 71.9MB. 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. [2021-12-21 22:50:24,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:24,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:24,572 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