./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrchr-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/cstrchr-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 71679b2a85162a2bf4315b62ab1893b5cfd06e20fc9e264973bd31bc9d08e300 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:34:48,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:34:48,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:34:48,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:34:48,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:34:48,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:34:48,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:34:48,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:34:48,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:34:48,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:34:48,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:34:48,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:34:48,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:34:48,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:34:48,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:34:48,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:34:48,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:34:48,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:34:48,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:34:48,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:34:48,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:34:48,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:34:48,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:34:48,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:34:48,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:34:48,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:34:48,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:34:48,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:34:48,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:34:48,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:34:48,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:34:48,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:34:48,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:34:48,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:34:48,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:34:48,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:34:48,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:34:48,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:34:48,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:34:48,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:34:48,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:34:48,413 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:34:48,438 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:34:48,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:34:48,438 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:34:48,438 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:34:48,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:34:48,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:34:48,440 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:34:48,440 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:34:48,440 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:34:48,440 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:34:48,441 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:34:48,441 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:34:48,441 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:34:48,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:34:48,442 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:34:48,442 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:34:48,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:34:48,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:34:48,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:34:48,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:34:48,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:34:48,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:34:48,443 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:34:48,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:34:48,444 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:34:48,444 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:34:48,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:34:48,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:34:48,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:34:48,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:34:48,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:34:48,446 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:34:48,446 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 -> 71679b2a85162a2bf4315b62ab1893b5cfd06e20fc9e264973bd31bc9d08e300 [2022-02-21 04:34:48,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:34:48,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:34:48,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:34:48,688 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:34:48,688 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:34:48,689 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrchr-alloca-2.i [2022-02-21 04:34:48,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acbfe7b9d/8c0a3bbc09ce42ce885c95aad1ad5f3c/FLAG06fca055d [2022-02-21 04:34:49,155 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:34:49,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrchr-alloca-2.i [2022-02-21 04:34:49,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acbfe7b9d/8c0a3bbc09ce42ce885c95aad1ad5f3c/FLAG06fca055d [2022-02-21 04:34:49,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acbfe7b9d/8c0a3bbc09ce42ce885c95aad1ad5f3c [2022-02-21 04:34:49,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:34:49,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:34:49,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:49,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:34:49,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:34:49,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3820517c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49, skipping insertion in model container [2022-02-21 04:34:49,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:34:49,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:34:49,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:49,509 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:34:49,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:49,581 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:34:49,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49 WrapperNode [2022-02-21 04:34:49,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:49,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:49,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:34:49,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:34:49,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,628 INFO L137 Inliner]: procedures = 117, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-02-21 04:34:49,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:49,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:34:49,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:34:49,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:34:49,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:34:49,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:34:49,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:34:49,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:34:49,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:49,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:49,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:49,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:34:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:34:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:34:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:34:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:34:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:34:49,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:34:49,808 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:34:49,810 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:34:49,973 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:34:49,977 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:34:49,977 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:34:49,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:49 BoogieIcfgContainer [2022-02-21 04:34:49,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:34:49,979 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:34:49,979 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:34:49,982 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:34:49,982 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:49,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:34:49" (1/3) ... [2022-02-21 04:34:49,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e23f0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:49, skipping insertion in model container [2022-02-21 04:34:49,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:49,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (2/3) ... [2022-02-21 04:34:49,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e23f0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:49, skipping insertion in model container [2022-02-21 04:34:49,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:49,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:49" (3/3) ... [2022-02-21 04:34:49,985 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrchr-alloca-2.i [2022-02-21 04:34:50,013 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:34:50,013 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:34:50,013 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:34:50,013 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:34:50,013 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:34:50,013 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:34:50,014 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:34:50,014 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:34:50,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:50,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:34:50,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:50,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:50,071 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:34:50,071 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:50,071 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:34:50,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:50,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:34:50,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:50,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:50,074 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:34:50,074 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:50,079 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~0#1, main_#t~nondet12#1, main_#t~ret13#1.base, main_#t~ret13#1.offset, main_~length~0#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 17#L522true assume !(main_~length~0#1 < 1); 12#L522-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 9#L527-3true [2022-02-21 04:34:50,079 INFO L793 eck$LassoCheckResult]: Loop: 9#L527-3true assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet11#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet11#1; 13#L527-2true main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9#L527-3true [2022-02-21 04:34:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:50,082 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-02-21 04:34:50,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:50,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485502292] [2022-02-21 04:34:50,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:50,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:50,195 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:50,225 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:50,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-02-21 04:34:50,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:50,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832211016] [2022-02-21 04:34:50,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:50,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:50,242 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:50,247 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:50,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:50,248 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-02-21 04:34:50,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:50,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138657180] [2022-02-21 04:34:50,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:50,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:50,274 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:50,304 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:50,536 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:50,537 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:50,537 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:50,537 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:50,537 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:50,537 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:50,537 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:50,538 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:50,538 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrchr-alloca-2.i_Iteration1_Lasso [2022-02-21 04:34:50,538 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:50,538 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:50,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:51,012 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:51,015 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:51,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:34:51,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:34:51,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:34:51,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 04:34:51,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,207 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:34:51,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,276 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:34:51,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:34:51,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,376 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:34:51,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,433 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:34:51,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,498 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:34:51,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,550 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:34:51,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,596 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:34:51,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,633 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:34:51,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,680 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:34:51,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,713 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 [2022-02-21 04:34:51,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,714 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:34:51,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,759 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:34:51,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,808 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:34:51,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:34:51,854 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 04:34:51,854 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. [2022-02-21 04:34:51,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,857 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:34:51,859 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:34:51,876 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:34:51,876 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:34:51,876 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~length~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~length~0#1 Supporting invariants [] [2022-02-21 04:34:51,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 04:34:51,937 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 04:34:51,952 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet11#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet11#1;" "main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2022-02-21 04:34:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:34:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:52,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {27#unseeded} is VALID [2022-02-21 04:34:52,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~0#1, main_#t~nondet12#1, main_#t~ret13#1.base, main_#t~ret13#1.offset, main_~length~0#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {27#unseeded} is VALID [2022-02-21 04:34:52,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#unseeded} assume !(main_~length~0#1 < 1); {27#unseeded} is VALID [2022-02-21 04:34:52,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#unseeded} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; {27#unseeded} is VALID [2022-02-21 04:34:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:34:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:52,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet11#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet11#1; {69#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 04:34:52,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length~0#1|))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {55#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|))) unseeded)} is VALID [2022-02-21 04:34:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:52,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:52,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:52,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:52,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,135 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:34:52,137 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,217 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 57 transitions. Complement of second has 7 states. [2022-02-21 04:34:52,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:34:52,218 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:52,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,220 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:34:52,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:52,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 57 transitions. [2022-02-21 04:34:52,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:52,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,228 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:34:52,231 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:34:52,231 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:52,233 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:34:52,234 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 57 transitions. cyclomatic complexity: 20 [2022-02-21 04:34:52,234 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:34:52,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:52,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:52,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:52,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:52,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:52,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:52,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 41 letters. Loop has 41 letters. [2022-02-21 04:34:52,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 41 letters. [2022-02-21 04:34:52,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 41 letters. Loop has 41 letters. [2022-02-21 04:34:52,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:34:52,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:34:52,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:34:52,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:52,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:52,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:52,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:52,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:52,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:52,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:52,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:52,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:52,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:52,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:52,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:52,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:52,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:52,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:52,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:52,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:52,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:52,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:52,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:52,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:52,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:52,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:52,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:52,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:52,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:52,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:52,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:52,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:52,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 57 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:52,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,251 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-02-21 04:34:52,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:52,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:52,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:52,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 57 transitions. cyclomatic complexity: 20 [2022-02-21 04:34:52,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:52,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 11 states and 15 transitions. [2022-02-21 04:34:52,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 04:34:52,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 04:34:52,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2022-02-21 04:34:52,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:52,263 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 04:34:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2022-02-21 04:34:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-21 04:34:52,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:52,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,279 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,281 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:52,283 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2022-02-21 04:34:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-02-21 04:34:52,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:52,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:52,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 15 transitions. [2022-02-21 04:34:52,284 INFO L87 Difference]: Start difference. First operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 15 transitions. [2022-02-21 04:34:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:52,285 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2022-02-21 04:34:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-02-21 04:34:52,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:52,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:52,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:52,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-02-21 04:34:52,287 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 04:34:52,288 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 04:34:52,288 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:34:52,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2022-02-21 04:34:52,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:52,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,289 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:34:52,289 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:34:52,289 INFO L791 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 128#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~0#1, main_#t~nondet12#1, main_#t~ret13#1.base, main_#t~ret13#1.offset, main_~length~0#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 134#L522 assume !(main_~length~0#1 < 1); 129#L522-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 130#L527-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 133#L527-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrchr } true;cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset, cstrchr_#in~c#1 := main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_#t~nondet12#1;havoc cstrchr_#res#1.base, cstrchr_#res#1.offset;havoc cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset, cstrchr_#t~mem2#1, cstrchr_#t~mem3#1, cstrchr_#t~short4#1, cstrchr_#t~mem6#1, cstrchr_#t~ite7#1.base, cstrchr_#t~ite7#1.offset, cstrchr_~s#1.base, cstrchr_~s#1.offset, cstrchr_~c#1;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset;cstrchr_~c#1 := cstrchr_#in~c#1; 124#L516-5 [2022-02-21 04:34:52,290 INFO L793 eck$LassoCheckResult]: Loop: 124#L516-5 call cstrchr_#t~mem2#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1);cstrchr_#t~short4#1 := 0 != cstrchr_#t~mem2#1; 125#L516-1 assume !cstrchr_#t~short4#1; 126#L516-3 assume !!cstrchr_#t~short4#1;havoc cstrchr_#t~mem2#1;havoc cstrchr_#t~mem3#1;havoc cstrchr_#t~short4#1;cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset := cstrchr_~s#1.base, cstrchr_~s#1.offset;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#t~post5#1.base, 1 + cstrchr_#t~post5#1.offset;havoc cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset; 124#L516-5 [2022-02-21 04:34:52,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,290 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-02-21 04:34:52,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426170447] [2022-02-21 04:34:52,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,304 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,315 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:52,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,316 INFO L85 PathProgramCache]: Analyzing trace with hash 57761, now seen corresponding path program 1 times [2022-02-21 04:34:52,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618278734] [2022-02-21 04:34:52,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#true} call cstrchr_#t~mem2#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1);cstrchr_#t~short4#1 := 0 != cstrchr_#t~mem2#1; {162#true} is VALID [2022-02-21 04:34:52,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} assume !cstrchr_#t~short4#1; {164#(not |ULTIMATE.start_cstrchr_#t~short4#1|)} is VALID [2022-02-21 04:34:52,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {164#(not |ULTIMATE.start_cstrchr_#t~short4#1|)} assume !!cstrchr_#t~short4#1;havoc cstrchr_#t~mem2#1;havoc cstrchr_#t~mem3#1;havoc cstrchr_#t~short4#1;cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset := cstrchr_~s#1.base, cstrchr_~s#1.offset;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#t~post5#1.base, 1 + cstrchr_#t~post5#1.offset;havoc cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset; {163#false} is VALID [2022-02-21 04:34:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:52,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:52,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618278734] [2022-02-21 04:34:52,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618278734] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:34:52,357 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:34:52,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:34:52,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118984819] [2022-02-21 04:34:52,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:34:52,360 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:34:52,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:52,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:34:52,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:34:52,362 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:52,392 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2022-02-21 04:34:52,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:34:52,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:52,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2022-02-21 04:34:52,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:52,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 14 transitions. [2022-02-21 04:34:52,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 04:34:52,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 04:34:52,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-02-21 04:34:52,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:52,398 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 04:34:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-02-21 04:34:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-21 04:34:52,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:52,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,400 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,400 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:52,401 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 04:34:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 04:34:52,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:52,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:52,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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 11 states and 14 transitions. [2022-02-21 04:34:52,402 INFO L87 Difference]: Start difference. First operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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 11 states and 14 transitions. [2022-02-21 04:34:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:52,402 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 04:34:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 04:34:52,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:52,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:52,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:52,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-02-21 04:34:52,404 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 04:34:52,404 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 04:34:52,404 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:34:52,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-02-21 04:34:52,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:52,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,406 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:34:52,406 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:34:52,406 INFO L791 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~0#1, main_#t~nondet12#1, main_#t~ret13#1.base, main_#t~ret13#1.offset, main_~length~0#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 187#L522 assume !(main_~length~0#1 < 1); 182#L522-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 183#L527-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 186#L527-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrchr } true;cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset, cstrchr_#in~c#1 := main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_#t~nondet12#1;havoc cstrchr_#res#1.base, cstrchr_#res#1.offset;havoc cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset, cstrchr_#t~mem2#1, cstrchr_#t~mem3#1, cstrchr_#t~short4#1, cstrchr_#t~mem6#1, cstrchr_#t~ite7#1.base, cstrchr_#t~ite7#1.offset, cstrchr_~s#1.base, cstrchr_~s#1.offset, cstrchr_~c#1;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset;cstrchr_~c#1 := cstrchr_#in~c#1; 177#L516-5 [2022-02-21 04:34:52,406 INFO L793 eck$LassoCheckResult]: Loop: 177#L516-5 call cstrchr_#t~mem2#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1);cstrchr_#t~short4#1 := 0 != cstrchr_#t~mem2#1; 178#L516-1 assume cstrchr_#t~short4#1;call cstrchr_#t~mem3#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1);cstrchr_#t~short4#1 := cstrchr_#t~mem3#1 != (if cstrchr_~c#1 % 256 <= 127 then cstrchr_~c#1 % 256 else cstrchr_~c#1 % 256 - 256); 179#L516-3 assume !!cstrchr_#t~short4#1;havoc cstrchr_#t~mem2#1;havoc cstrchr_#t~mem3#1;havoc cstrchr_#t~short4#1;cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset := cstrchr_~s#1.base, cstrchr_~s#1.offset;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#t~post5#1.base, 1 + cstrchr_#t~post5#1.offset;havoc cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset; 177#L516-5 [2022-02-21 04:34:52,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,407 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2022-02-21 04:34:52,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344530280] [2022-02-21 04:34:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,430 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,438 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash 57699, now seen corresponding path program 1 times [2022-02-21 04:34:52,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144452710] [2022-02-21 04:34:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,447 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,453 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:52,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1183926615, now seen corresponding path program 1 times [2022-02-21 04:34:52,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444916763] [2022-02-21 04:34:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {217#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {217#true} is VALID [2022-02-21 04:34:52,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~0#1, main_#t~nondet12#1, main_#t~ret13#1.base, main_#t~ret13#1.offset, main_~length~0#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {217#true} is VALID [2022-02-21 04:34:52,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#true} assume !(main_~length~0#1 < 1); {219#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 04:34:52,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {219#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; {220#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))} is VALID [2022-02-21 04:34:52,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {220#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {221#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1) (not (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))} is VALID [2022-02-21 04:34:52,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {221#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1) (not (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))} call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrchr } true;cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset, cstrchr_#in~c#1 := main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_#t~nondet12#1;havoc cstrchr_#res#1.base, cstrchr_#res#1.offset;havoc cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset, cstrchr_#t~mem2#1, cstrchr_#t~mem3#1, cstrchr_#t~short4#1, cstrchr_#t~mem6#1, cstrchr_#t~ite7#1.base, cstrchr_#t~ite7#1.offset, cstrchr_~s#1.base, cstrchr_~s#1.offset, cstrchr_~c#1;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset;cstrchr_~c#1 := cstrchr_#in~c#1; {222#(= (select (select |#memory_int| |ULTIMATE.start_cstrchr_~s#1.base|) |ULTIMATE.start_cstrchr_~s#1.offset|) 0)} is VALID [2022-02-21 04:34:52,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(= (select (select |#memory_int| |ULTIMATE.start_cstrchr_~s#1.base|) |ULTIMATE.start_cstrchr_~s#1.offset|) 0)} call cstrchr_#t~mem2#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1);cstrchr_#t~short4#1 := 0 != cstrchr_#t~mem2#1; {223#(not |ULTIMATE.start_cstrchr_#t~short4#1|)} is VALID [2022-02-21 04:34:52,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(not |ULTIMATE.start_cstrchr_#t~short4#1|)} assume cstrchr_#t~short4#1;call cstrchr_#t~mem3#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1);cstrchr_#t~short4#1 := cstrchr_#t~mem3#1 != (if cstrchr_~c#1 % 256 <= 127 then cstrchr_~c#1 % 256 else cstrchr_~c#1 % 256 - 256); {218#false} is VALID [2022-02-21 04:34:52,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#false} assume !!cstrchr_#t~short4#1;havoc cstrchr_#t~mem2#1;havoc cstrchr_#t~mem3#1;havoc cstrchr_#t~short4#1;cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset := cstrchr_~s#1.base, cstrchr_~s#1.offset;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#t~post5#1.base, 1 + cstrchr_#t~post5#1.offset;havoc cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset; {218#false} is VALID [2022-02-21 04:34:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:52,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:52,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444916763] [2022-02-21 04:34:52,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444916763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:34:52,559 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:34:52,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 04:34:52,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334955415] [2022-02-21 04:34:52,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:34:52,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:52,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:34:52,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:34:52,661 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:52,787 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 04:34:52,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:34:52,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:52,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2022-02-21 04:34:52,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:52,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 14 transitions. [2022-02-21 04:34:52,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 04:34:52,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 04:34:52,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2022-02-21 04:34:52,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:52,797 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-02-21 04:34:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2022-02-21 04:34:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-02-21 04:34:52,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:52,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,798 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,798 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:52,799 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2022-02-21 04:34:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-02-21 04:34:52,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:52,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:52,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 14 transitions. [2022-02-21 04:34:52,799 INFO L87 Difference]: Start difference. First operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 14 transitions. [2022-02-21 04:34:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:52,801 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2022-02-21 04:34:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-02-21 04:34:52,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:52,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:52,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:52,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2022-02-21 04:34:52,802 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-02-21 04:34:52,802 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-02-21 04:34:52,802 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:34:52,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2022-02-21 04:34:52,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:52,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,803 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:52,803 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:34:52,804 INFO L791 eck$LassoCheckResult]: Stem: 248#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 249#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~0#1, main_#t~nondet12#1, main_#t~ret13#1.base, main_#t~ret13#1.offset, main_~length~0#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 255#L522 assume !(main_~length~0#1 < 1); 250#L522-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 251#L527-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet11#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet11#1; 252#L527-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 253#L527-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 254#L527-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrchr } true;cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset, cstrchr_#in~c#1 := main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_#t~nondet12#1;havoc cstrchr_#res#1.base, cstrchr_#res#1.offset;havoc cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset, cstrchr_#t~mem2#1, cstrchr_#t~mem3#1, cstrchr_#t~short4#1, cstrchr_#t~mem6#1, cstrchr_#t~ite7#1.base, cstrchr_#t~ite7#1.offset, cstrchr_~s#1.base, cstrchr_~s#1.offset, cstrchr_~c#1;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset;cstrchr_~c#1 := cstrchr_#in~c#1; 245#L516-5 [2022-02-21 04:34:52,804 INFO L793 eck$LassoCheckResult]: Loop: 245#L516-5 call cstrchr_#t~mem2#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1);cstrchr_#t~short4#1 := 0 != cstrchr_#t~mem2#1; 246#L516-1 assume cstrchr_#t~short4#1;call cstrchr_#t~mem3#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1);cstrchr_#t~short4#1 := cstrchr_#t~mem3#1 != (if cstrchr_~c#1 % 256 <= 127 then cstrchr_~c#1 % 256 else cstrchr_~c#1 % 256 - 256); 247#L516-3 assume !!cstrchr_#t~short4#1;havoc cstrchr_#t~mem2#1;havoc cstrchr_#t~mem3#1;havoc cstrchr_#t~short4#1;cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset := cstrchr_~s#1.base, cstrchr_~s#1.offset;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#t~post5#1.base, 1 + cstrchr_#t~post5#1.offset;havoc cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset; 245#L516-5 [2022-02-21 04:34:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-02-21 04:34:52,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124626061] [2022-02-21 04:34:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,852 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash 57699, now seen corresponding path program 2 times [2022-02-21 04:34:52,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599706217] [2022-02-21 04:34:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,862 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,869 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:52,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1235380661, now seen corresponding path program 1 times [2022-02-21 04:34:52,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488668639] [2022-02-21 04:34:52,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,892 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,906 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:53,214 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:53,214 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:53,214 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:53,214 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:53,214 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:53,214 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,214 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:53,214 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:53,214 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrchr-alloca-2.i_Iteration4_Lasso [2022-02-21 04:34:53,214 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:53,214 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:53,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,499 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:34:53,501 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:34:54,066 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:54,066 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:54,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,068 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:34:54,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,108 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:34:54,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,150 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:34:54,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,207 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:34:54,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,248 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:34:54,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 04:34:54,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,290 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:34:54,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:54,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:54,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,340 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:34:54,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,399 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:34:54,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 04:34:54,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,457 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:34:54,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:54,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:54,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,539 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) [2022-02-21 04:34:54,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,559 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 [2022-02-21 04:34:54,567 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 [2022-02-21 04:34:54,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,569 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) [2022-02-21 04:34:54,570 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 [2022-02-21 04:34:54,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:54,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:54,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,611 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 [2022-02-21 04:34:54,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,632 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) [2022-02-21 04:34:54,633 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 [2022-02-21 04:34:54,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,684 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 [2022-02-21 04:34:54,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,685 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 04:34:54,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,714 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 04:34:54,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,747 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 04:34:54,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:54,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:54,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,808 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 04:34:54,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,849 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 04:34:54,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,885 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 04:34:54,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,913 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 04:34:54,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:54,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,952 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 04:34:54,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:54,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:54,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:54,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:55,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:55,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:55,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:55,005 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:55,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 04:34:55,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:55,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:55,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:55,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:55,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:55,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:55,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:55,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:55,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:55,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:55,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:55,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:55,041 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:55,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:55,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:55,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:55,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:55,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:55,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 04:34:55,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:55,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:55,077 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:34:55,094 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 04:34:55,094 INFO L444 ModelExtractionUtils]: 17 out of 28 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-02-21 04:34:55,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:55,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:55,103 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:55,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 04:34:55,106 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:34:55,123 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:34:55,123 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:34:55,123 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrchr_~s#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_2) = -1*ULTIMATE.start_cstrchr_~s#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_2 Supporting invariants [] [2022-02-21 04:34:55,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-02-21 04:34:55,170 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2022-02-21 04:34:55,180 INFO L390 LassoCheck]: Loop: "call cstrchr_#t~mem2#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1);cstrchr_#t~short4#1 := 0 != cstrchr_#t~mem2#1;" "assume cstrchr_#t~short4#1;call cstrchr_#t~mem3#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1);cstrchr_#t~short4#1 := cstrchr_#t~mem3#1 != (if cstrchr_~c#1 % 256 <= 127 then cstrchr_~c#1 % 256 else cstrchr_~c#1 % 256 - 256);" "assume !!cstrchr_#t~short4#1;havoc cstrchr_#t~mem2#1;havoc cstrchr_#t~mem3#1;havoc cstrchr_#t~short4#1;cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset := cstrchr_~s#1.base, cstrchr_~s#1.offset;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#t~post5#1.base, 1 + cstrchr_#t~post5#1.offset;havoc cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset;" [2022-02-21 04:34:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:55,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:55,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:34:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:55,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:55,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {289#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {289#unseeded} is VALID [2022-02-21 04:34:55,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {289#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~0#1, main_#t~nondet12#1, main_#t~ret13#1.base, main_#t~ret13#1.offset, main_~length~0#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {289#unseeded} is VALID [2022-02-21 04:34:55,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {289#unseeded} assume !(main_~length~0#1 < 1); {289#unseeded} is VALID [2022-02-21 04:34:55,267 INFO L290 TraceCheckUtils]: 3: Hoare triple {289#unseeded} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; {346#(and (= |ULTIMATE.start_main_#t~malloc9#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 04:34:55,275 INFO L290 TraceCheckUtils]: 4: Hoare triple {346#(and (= |ULTIMATE.start_main_#t~malloc9#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) unseeded)} assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet11#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet11#1; {346#(and (= |ULTIMATE.start_main_#t~malloc9#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 04:34:55,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {346#(and (= |ULTIMATE.start_main_#t~malloc9#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) unseeded)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {346#(and (= |ULTIMATE.start_main_#t~malloc9#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 04:34:55,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {346#(and (= |ULTIMATE.start_main_#t~malloc9#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) unseeded)} assume !(main_~i~0#1 < main_~length~0#1 - 1); {346#(and (= |ULTIMATE.start_main_#t~malloc9#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 04:34:55,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {346#(and (= |ULTIMATE.start_main_#t~malloc9#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) unseeded)} call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrchr } true;cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset, cstrchr_#in~c#1 := main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_#t~nondet12#1;havoc cstrchr_#res#1.base, cstrchr_#res#1.offset;havoc cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset, cstrchr_#t~mem2#1, cstrchr_#t~mem3#1, cstrchr_#t~short4#1, cstrchr_#t~mem6#1, cstrchr_#t~ite7#1.base, cstrchr_#t~ite7#1.offset, cstrchr_~s#1.base, cstrchr_~s#1.offset, cstrchr_~c#1;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#in~s#1.base, cstrchr_#in~s#1.offset;cstrchr_~c#1 := cstrchr_#in~c#1; {328#(and unseeded (= |ULTIMATE.start_cstrchr_~s#1.base| |ULTIMATE.start_main_#t~malloc9#1.base|))} is VALID [2022-02-21 04:34:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:55,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:34:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:55,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:55,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrchr_~s#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|))) (= |ULTIMATE.start_cstrchr_~s#1.base| |ULTIMATE.start_main_#t~malloc9#1.base|))} call cstrchr_#t~mem2#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1);cstrchr_#t~short4#1 := 0 != cstrchr_#t~mem2#1; {359#(and (<= (+ |ULTIMATE.start_cstrchr_~s#1.offset| 1) (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrchr_~s#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|))) (= |ULTIMATE.start_cstrchr_~s#1.base| |ULTIMATE.start_main_#t~malloc9#1.base|))} is VALID [2022-02-21 04:34:55,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {359#(and (<= (+ |ULTIMATE.start_cstrchr_~s#1.offset| 1) (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrchr_~s#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|))) (= |ULTIMATE.start_cstrchr_~s#1.base| |ULTIMATE.start_main_#t~malloc9#1.base|))} assume cstrchr_#t~short4#1;call cstrchr_#t~mem3#1 := read~int(cstrchr_~s#1.base, cstrchr_~s#1.offset, 1);cstrchr_#t~short4#1 := cstrchr_#t~mem3#1 != (if cstrchr_~c#1 % 256 <= 127 then cstrchr_~c#1 % 256 else cstrchr_~c#1 % 256 - 256); {359#(and (<= (+ |ULTIMATE.start_cstrchr_~s#1.offset| 1) (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrchr_~s#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|))) (= |ULTIMATE.start_cstrchr_~s#1.base| |ULTIMATE.start_main_#t~malloc9#1.base|))} is VALID [2022-02-21 04:34:55,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {359#(and (<= (+ |ULTIMATE.start_cstrchr_~s#1.offset| 1) (select |#length| |ULTIMATE.start_cstrchr_~s#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrchr_~s#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|))) (= |ULTIMATE.start_cstrchr_~s#1.base| |ULTIMATE.start_main_#t~malloc9#1.base|))} assume !!cstrchr_#t~short4#1;havoc cstrchr_#t~mem2#1;havoc cstrchr_#t~mem3#1;havoc cstrchr_#t~short4#1;cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset := cstrchr_~s#1.base, cstrchr_~s#1.offset;cstrchr_~s#1.base, cstrchr_~s#1.offset := cstrchr_#t~post5#1.base, 1 + cstrchr_#t~post5#1.offset;havoc cstrchr_#t~post5#1.base, cstrchr_#t~post5#1.offset; {331#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrchr_~s#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|))))) (= |ULTIMATE.start_cstrchr_~s#1.base| |ULTIMATE.start_main_#t~malloc9#1.base|))} is VALID [2022-02-21 04:34:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:55,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2022-02-21 04:34:55,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:55,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:55,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,347 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 04:34:55,347 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2022-02-21 04:34:55,392 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 14 states and 17 transitions. Complement of second has 5 states. [2022-02-21 04:34:55,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:34:55,392 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:55,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2022-02-21 04:34:55,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:55,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:55,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2022-02-21 04:34:55,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:55,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:55,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:55,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2022-02-21 04:34:55,393 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:34:55,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:34:55,394 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2022-02-21 04:34:55,394 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:34:55,394 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2022-02-21 04:34:55,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:55,395 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:34:55,395 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 04:34:55,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 04:34:55,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:34:55,395 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:34:55,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:55,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:55,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:55,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:55,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:55,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:55,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 14 letters. [2022-02-21 04:34:55,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 14 letters. Loop has 14 letters. [2022-02-21 04:34:55,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 14 letters. [2022-02-21 04:34:55,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2022-02-21 04:34:55,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 04:34:55,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2022-02-21 04:34:55,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:55,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:55,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:55,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:55,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:55,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:55,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:55,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:55,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:55,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:55,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:55,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:55,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:55,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:55,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:55,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,399 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2022-02-21 04:34:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 04:34:55,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:55,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:55,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 6 letters. [2022-02-21 04:34:55,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 04:34:55,401 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:34:55,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2022-02-21 04:34:55,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:34:55,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:34:55,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:34:55,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:55,401 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:34:55,401 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:34:55,401 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:34:55,402 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:34:55,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:34:55,402 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:34:55,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:34:55,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:34:55 BoogieIcfgContainer [2022-02-21 04:34:55,407 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:34:55,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:34:55,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:34:55,408 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:34:55,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:49" (3/4) ... [2022-02-21 04:34:55,410 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:34:55,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:34:55,411 INFO L158 Benchmark]: Toolchain (without parser) took 6212.41ms. Allocated memory was 107.0MB in the beginning and 155.2MB in the end (delta: 48.2MB). Free memory was 70.7MB in the beginning and 100.6MB in the end (delta: -29.9MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2022-02-21 04:34:55,411 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:34:55,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.10ms. Allocated memory is still 107.0MB. Free memory was 70.5MB in the beginning and 75.2MB in the end (delta: -4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:34:55,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.36ms. Allocated memory is still 107.0MB. Free memory was 75.2MB in the beginning and 73.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:34:55,411 INFO L158 Benchmark]: Boogie Preprocessor took 42.56ms. Allocated memory is still 107.0MB. Free memory was 73.3MB in the beginning and 71.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:34:55,411 INFO L158 Benchmark]: RCFGBuilder took 306.72ms. Allocated memory is still 107.0MB. Free memory was 71.8MB in the beginning and 59.7MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:34:55,412 INFO L158 Benchmark]: BuchiAutomizer took 5427.75ms. Allocated memory was 107.0MB in the beginning and 155.2MB in the end (delta: 48.2MB). Free memory was 59.7MB in the beginning and 100.6MB in the end (delta: -40.9MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2022-02-21 04:34:55,412 INFO L158 Benchmark]: Witness Printer took 2.38ms. Allocated memory is still 155.2MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:34:55,413 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.10ms. Allocated memory is still 107.0MB. Free memory was 70.5MB in the beginning and 75.2MB in the end (delta: -4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.36ms. Allocated memory is still 107.0MB. Free memory was 75.2MB in the beginning and 73.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.56ms. Allocated memory is still 107.0MB. Free memory was 73.3MB in the beginning and 71.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 306.72ms. Allocated memory is still 107.0MB. Free memory was 71.8MB in the beginning and 59.7MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5427.75ms. Allocated memory was 107.0MB in the beginning and 155.2MB in the end (delta: 48.2MB). Free memory was 59.7MB in the beginning and 100.6MB in the end (delta: -40.9MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Witness Printer took 2.38ms. Allocated memory is still 155.2MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 43 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital128 mio100 ax115 hnf100 lsp82 ukn88 mio100 lsp48 div120 bol100 ite100 ukn100 eq164 hnf92 smp88 dnf368 smp65 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:34:55,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE