./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/cstrspn.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted-lit/cstrspn.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ecf20dd2c3ee96f4ce33fb05fe8b8a847f94671834911abc2dee98681c717cc6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:25:24,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:25:24,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:25:24,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:25:24,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:25:24,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:25:24,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:25:24,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:25:24,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:25:24,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:25:24,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:25:24,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:25:24,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:25:24,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:25:24,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:25:24,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:25:24,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:25:24,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:25:24,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:25:24,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:25:24,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:25:24,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:25:24,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:25:24,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:25:24,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:25:24,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:25:24,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:25:24,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:25:24,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:25:24,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:25:24,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:25:24,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:25:24,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:25:24,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:25:24,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:25:24,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:25:24,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:25:24,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:25:24,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:25:24,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:25:24,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:25:24,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:25:24,734 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:25:24,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:25:24,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:25:24,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:25:24,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:25:24,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:25:24,735 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:25:24,736 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:25:24,736 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:25:24,736 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:25:24,736 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:25:24,736 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:25:24,736 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:25:24,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:25:24,736 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:25:24,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:25:24,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:25:24,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:25:24,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:25:24,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:25:24,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:25:24,737 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:25:24,738 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:25:24,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:25:24,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:25:24,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:25:24,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:25:24,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:25:24,739 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:25:24,739 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ecf20dd2c3ee96f4ce33fb05fe8b8a847f94671834911abc2dee98681c717cc6 [2022-02-21 03:25:24,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:25:24,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:25:24,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:25:24,909 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:25:24,913 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:25:24,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/cstrspn.c [2022-02-21 03:25:24,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329ad9468/fbcc7fc667d34d4aad2550841dff3c55/FLAG372d15bcb [2022-02-21 03:25:25,280 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:25:25,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrspn.c [2022-02-21 03:25:25,285 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329ad9468/fbcc7fc667d34d4aad2550841dff3c55/FLAG372d15bcb [2022-02-21 03:25:25,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329ad9468/fbcc7fc667d34d4aad2550841dff3c55 [2022-02-21 03:25:25,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:25:25,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:25:25,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:25,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:25:25,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:25:25,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:25" (1/1) ... [2022-02-21 03:25:25,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be882a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:25, skipping insertion in model container [2022-02-21 03:25:25,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:25" (1/1) ... [2022-02-21 03:25:25,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:25:25,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:25:25,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:25,882 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:25:25,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:25,910 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:25:25,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:25 WrapperNode [2022-02-21 03:25:25,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:25,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:25,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:25:25,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:25:25,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:25" (1/1) ... [2022-02-21 03:25:25,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:25" (1/1) ... [2022-02-21 03:25:25,958 INFO L137 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 81 [2022-02-21 03:25:25,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:25,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:25:25,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:25:25,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:25:25,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:25" (1/1) ... [2022-02-21 03:25:25,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:25" (1/1) ... [2022-02-21 03:25:25,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:25" (1/1) ... [2022-02-21 03:25:25,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:25" (1/1) ... [2022-02-21 03:25:25,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:25" (1/1) ... [2022-02-21 03:25:26,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:25" (1/1) ... [2022-02-21 03:25:26,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:25" (1/1) ... [2022-02-21 03:25:26,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:25:26,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:25:26,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:25:26,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:25:26,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:25" (1/1) ... [2022-02-21 03:25:26,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:26,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:26,035 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 03:25:26,043 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 03:25:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:25:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:25:26,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:25:26,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:25:26,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:25:26,124 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:25:26,125 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:25:26,292 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:25:26,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:25:26,296 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:25:26,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:26 BoogieIcfgContainer [2022-02-21 03:25:26,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:25:26,298 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:25:26,298 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:25:26,300 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:25:26,301 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:26,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:25:25" (1/3) ... [2022-02-21 03:25:26,302 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48931318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:26, skipping insertion in model container [2022-02-21 03:25:26,302 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:26,302 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:25" (2/3) ... [2022-02-21 03:25:26,302 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48931318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:26, skipping insertion in model container [2022-02-21 03:25:26,302 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:26,303 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:26" (3/3) ... [2022-02-21 03:25:26,303 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrspn.c [2022-02-21 03:25:26,331 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:25:26,331 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:25:26,331 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:25:26,332 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:25:26,332 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:25:26,332 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:25:26,332 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:25:26,332 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:25:26,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:26,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:25:26,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:26,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:26,361 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:26,362 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:25:26,362 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:25:26,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:26,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:25:26,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:26,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:26,366 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:26,366 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:25:26,371 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; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 10#L14true assume !(build_nondet_String_~length~0#1 < 1); 19#L14-2true call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 18#L19true main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 11#L14-3true assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; 15#L14-5true call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 7#L19-1true main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 16#L31-4true [2022-02-21 03:25:26,371 INFO L793 eck$LassoCheckResult]: Loop: 16#L31-4true call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 17#L31-1true assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 13#L34-5true assume !true; 5#L34-6true call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 9#L36true assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 12#L31-3true cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 16#L31-4true [2022-02-21 03:25:26,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2022-02-21 03:25:26,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:26,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767622871] [2022-02-21 03:25:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:26,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:26,529 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:26,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2022-02-21 03:25:26,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:26,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716864202] [2022-02-21 03:25:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:26,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {27#true} is VALID [2022-02-21 03:25:26,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {27#true} is VALID [2022-02-21 03:25:26,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-02-21 03:25:26,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#false} call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {28#false} is VALID [2022-02-21 03:25:26,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#false} assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; {28#false} is VALID [2022-02-21 03:25:26,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#false} cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; {28#false} is VALID [2022-02-21 03:25:26,593 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 03:25:26,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:26,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716864202] [2022-02-21 03:25:26,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716864202] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:25:26,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:25:26,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:25:26,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617594713] [2022-02-21 03:25:26,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:25:26,599 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:25:26,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:26,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:25:26,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:25:26,622 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 03:25:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:26,654 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-02-21 03:25:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:25:26,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 03:25:26,662 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 03:25:26,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2022-02-21 03:25:26,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:25:26,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2022-02-21 03:25:26,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:25:26,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:25:26,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2022-02-21 03:25:26,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:25:26,679 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-21 03:25:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2022-02-21 03:25:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-21 03:25:26,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:26,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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 03:25:26,696 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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 03:25:26,698 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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 03:25:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:26,702 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2022-02-21 03:25:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-02-21 03:25:26,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:26,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:26,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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 16 states and 20 transitions. [2022-02-21 03:25:26,705 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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 16 states and 20 transitions. [2022-02-21 03:25:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:26,707 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2022-02-21 03:25:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-02-21 03:25:26,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:26,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:26,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:26,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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 03:25:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-02-21 03:25:26,714 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-21 03:25:26,714 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-21 03:25:26,714 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:25:26,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2022-02-21 03:25:26,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:25:26,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:26,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:26,720 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:26,720 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:26,720 INFO L791 eck$LassoCheckResult]: Stem: 50#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 51#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 57#L14 assume !(build_nondet_String_~length~0#1 < 1); 58#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 65#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 59#L14-3 assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; 60#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 54#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 55#L31-4 [2022-02-21 03:25:26,721 INFO L793 eck$LassoCheckResult]: Loop: 55#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 64#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 61#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 62#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 63#L34-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 52#L34-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 53#L36 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 56#L31-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 55#L31-4 [2022-02-21 03:25:26,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:26,723 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2022-02-21 03:25:26,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:26,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582980642] [2022-02-21 03:25:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:26,781 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:26,798 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:26,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2022-02-21 03:25:26,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:26,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191513519] [2022-02-21 03:25:26,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:26,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:26,836 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:26,853 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:26,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:26,856 INFO L85 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2022-02-21 03:25:26,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:26,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332925080] [2022-02-21 03:25:26,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:26,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:27,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {105#true} is VALID [2022-02-21 03:25:27,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {105#true} is VALID [2022-02-21 03:25:27,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {105#true} assume !(build_nondet_String_~length~0#1 < 1); {105#true} is VALID [2022-02-21 03:25:27,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {105#true} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {105#true} is VALID [2022-02-21 03:25:27,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {105#true} main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {105#true} is VALID [2022-02-21 03:25:27,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#true} assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; {107#(= (+ (- 1) |ULTIMATE.start_build_nondet_String_~length~0#1|) 0)} is VALID [2022-02-21 03:25:27,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {107#(= (+ (- 1) |ULTIMATE.start_build_nondet_String_~length~0#1|) 0)} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {108#(= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res#1.base|) |ULTIMATE.start_build_nondet_String_#res#1.offset|) 0)} is VALID [2022-02-21 03:25:27,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {108#(= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res#1.base|) |ULTIMATE.start_build_nondet_String_#res#1.offset|) 0)} main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {109#(= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s2#1.base|) |ULTIMATE.start_cstrspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:25:27,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {109#(= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s2#1.base|) |ULTIMATE.start_cstrspn_~s2#1.offset|) 0)} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {110#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s2#1.base|) |ULTIMATE.start_cstrspn_~s2#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) |ULTIMATE.start_cstrspn_#t~mem3#1|))} is VALID [2022-02-21 03:25:27,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {110#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s2#1.base|) |ULTIMATE.start_cstrspn_~s2#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) |ULTIMATE.start_cstrspn_#t~mem3#1|))} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {111#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:25:27,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {111#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {111#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:25:27,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {111#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {111#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:25:27,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {111#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; {111#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:25:27,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {111#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {112#(not (= |ULTIMATE.start_cstrspn_#t~mem9#1| |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:25:27,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {112#(not (= |ULTIMATE.start_cstrspn_#t~mem9#1| |ULTIMATE.start_cstrspn_~c~0#1|))} assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; {106#false} is VALID [2022-02-21 03:25:27,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {106#false} cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; {106#false} is VALID [2022-02-21 03:25:27,041 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 03:25:27,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:27,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332925080] [2022-02-21 03:25:27,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332925080] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:25:27,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:25:27,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 03:25:27,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303274187] [2022-02-21 03:25:27,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:25:27,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:27,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:25:27,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:25:27,313 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 03:25:27,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:27,598 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-02-21 03:25:27,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:25:27,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 03:25:27,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:27,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2022-02-21 03:25:27,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-02-21 03:25:27,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 38 transitions. [2022-02-21 03:25:27,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-02-21 03:25:27,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-02-21 03:25:27,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2022-02-21 03:25:27,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:25:27,618 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-02-21 03:25:27,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2022-02-21 03:25:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-02-21 03:25:27,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:27,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 38 transitions. Second operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 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 03:25:27,620 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 38 transitions. Second operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 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 03:25:27,620 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 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 03:25:27,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:27,622 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-21 03:25:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-21 03:25:27,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:27,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:27,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 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 31 states and 38 transitions. [2022-02-21 03:25:27,623 INFO L87 Difference]: Start difference. First operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 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 31 states and 38 transitions. [2022-02-21 03:25:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:27,624 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-21 03:25:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-21 03:25:27,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:27,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:27,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:27,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 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 03:25:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-02-21 03:25:27,626 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-02-21 03:25:27,626 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-02-21 03:25:27,626 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:25:27,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2022-02-21 03:25:27,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-02-21 03:25:27,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:27,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:27,627 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:27,627 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:27,628 INFO L791 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 158#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 165#L14 assume !(build_nondet_String_~length~0#1 < 1); 166#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 177#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 168#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 169#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 184#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 183#L31-4 [2022-02-21 03:25:27,628 INFO L793 eck$LassoCheckResult]: Loop: 183#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 175#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 176#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 185#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 179#L34-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 180#L34-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 163#L36 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 164#L31-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 183#L31-4 [2022-02-21 03:25:27,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:27,629 INFO L85 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2022-02-21 03:25:27,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:27,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516747576] [2022-02-21 03:25:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:27,644 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:27,655 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2022-02-21 03:25:27,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:27,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96915038] [2022-02-21 03:25:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:27,683 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:27,692 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:27,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:27,692 INFO L85 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2022-02-21 03:25:27,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:27,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749283420] [2022-02-21 03:25:27,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:27,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:27,731 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:27,756 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:28,435 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:28,435 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:28,436 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:28,436 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:28,436 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:28,436 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:28,436 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:28,436 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:28,436 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration3_Lasso [2022-02-21 03:25:28,436 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:28,436 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:28,463 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 03:25:28,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:28,787 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:25:28,789 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:25:28,796 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 03:25:28,798 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 03:25:28,800 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 03:25:28,802 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 03:25:28,803 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 03:25:28,805 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 03:25:28,806 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 03:25:28,808 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 03:25:28,809 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 03:25:28,810 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 03:25:28,811 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 03:25:28,813 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 03:25:28,814 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 03:25:28,815 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 03:25:28,817 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 03:25:28,818 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 03:25:28,819 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 03:25:29,514 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:29,517 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:29,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:29,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:29,531 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 03:25:29,550 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 03:25:29,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:29,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:29,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:29,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:29,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:29,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:29,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:29,561 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 03:25:29,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:29,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:25:29,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:29,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:29,587 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 03:25:29,611 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 03:25:29,617 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 03:25:29,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:29,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:29,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:29,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:29,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:29,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:29,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:29,661 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 03:25:29,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:29,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:29,663 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 03:25:29,679 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 03:25:29,680 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 03:25:29,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:29,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:29,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:29,687 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:25:29,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:29,690 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:25:29,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:29,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:29,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:29,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:29,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:29,738 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 03:25:29,739 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 03:25:29,740 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 03:25:29,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:29,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:29,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:29,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:29,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:29,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:29,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:29,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:29,797 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 03:25:29,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:29,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:29,798 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 03:25:29,799 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 03:25:29,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:29,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:29,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:29,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:29,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:29,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:29,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:29,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:29,872 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 03:25:29,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:29,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:29,874 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 03:25:29,874 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 03:25:29,876 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 03:25:29,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:29,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:29,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:29,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:29,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:29,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:29,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:29,983 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 03:25:29,983 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-02-21 03:25:29,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:29,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:29,985 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 03:25:30,027 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:30,028 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 03:25:30,048 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:25:30,048 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:30,048 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1 Supporting invariants [] [2022-02-21 03:25:30,088 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 03:25:30,109 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 03:25:30,115 INFO L390 LassoCheck]: Loop: "call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);" "assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1;" "call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1;" "assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;" "call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);" "assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1;" "cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset;" [2022-02-21 03:25:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:30,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:30,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:30,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:30,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {257#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {257#unseeded} is VALID [2022-02-21 03:25:30,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {257#unseeded} is VALID [2022-02-21 03:25:30,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#unseeded} assume !(build_nondet_String_~length~0#1 < 1); {257#unseeded} is VALID [2022-02-21 03:25:30,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {257#unseeded} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {257#unseeded} is VALID [2022-02-21 03:25:30,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {257#unseeded} main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {257#unseeded} is VALID [2022-02-21 03:25:30,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#unseeded} assume !(build_nondet_String_~length~0#1 < 1); {257#unseeded} is VALID [2022-02-21 03:25:30,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {257#unseeded} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {257#unseeded} is VALID [2022-02-21 03:25:30,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#unseeded} main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {301#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) unseeded)} is VALID [2022-02-21 03:25:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:30,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:25:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:30,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:30,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))))} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:25:30,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:25:30,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:25:30,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:25:30,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:25:30,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:25:30,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:25:30,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; {304#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_#t~ret10#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))))))} is VALID [2022-02-21 03:25:30,380 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 03:25:30,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 03:25:30,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:30,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 8 letters. [2022-02-21 03:25:30,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,392 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 03:25:30,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 03:25:30,454 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 48 states and 62 transitions. Complement of second has 4 states. [2022-02-21 03:25:30,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:30,454 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:30,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. cyclomatic complexity: 9 [2022-02-21 03:25:30,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:30,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:30,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 03:25:30,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:30,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:30,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:30,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 62 transitions. [2022-02-21 03:25:30,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:25:30,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:30,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:30,462 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 36 transitions. cyclomatic complexity: 9 [2022-02-21 03:25:30,471 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2022-02-21 03:25:30,471 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 03:25:30,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:30,474 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:30,474 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 62 transitions. cyclomatic complexity: 18 [2022-02-21 03:25:30,474 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:25:30,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:30,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 8 letters. [2022-02-21 03:25:30,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:30,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:30,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 03:25:30,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:30,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:30,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 03:25:30,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:30,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 48 letters. Loop has 48 letters. [2022-02-21 03:25:30,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 48 letters. Loop has 48 letters. [2022-02-21 03:25:30,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 48 letters. Loop has 48 letters. [2022-02-21 03:25:30,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:25:30,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 29 letters. Loop has 29 letters. [2022-02-21 03:25:30,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:25:30,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:30,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 3 letters. Loop has 3 letters. [2022-02-21 03:25:30,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:30,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:25:30,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 11 letters. [2022-02-21 03:25:30,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:25:30,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:25:30,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 12 letters. Loop has 11 letters. [2022-02-21 03:25:30,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:25:30,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 11 letters. [2022-02-21 03:25:30,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 11 letters. [2022-02-21 03:25:30,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 11 letters. [2022-02-21 03:25:30,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:25:30,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 03:25:30,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:25:30,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 11 letters. [2022-02-21 03:25:30,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 11 letters. [2022-02-21 03:25:30,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 11 letters. [2022-02-21 03:25:30,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 11 letters. [2022-02-21 03:25:30,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 18 letters. Loop has 11 letters. [2022-02-21 03:25:30,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 11 letters. [2022-02-21 03:25:30,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:25:30,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 13 letters. Loop has 3 letters. [2022-02-21 03:25:30,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:25:30,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:25:30,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 3 letters. [2022-02-21 03:25:30,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:25:30,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:25:30,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 15 letters. Loop has 3 letters. [2022-02-21 03:25:30,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:25:30,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 11 letters. [2022-02-21 03:25:30,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 11 letters. [2022-02-21 03:25:30,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 11 letters. [2022-02-21 03:25:30,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 11 letters. [2022-02-21 03:25:30,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 letters. Loop has 11 letters. [2022-02-21 03:25:30,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 11 letters. [2022-02-21 03:25:30,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:30,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 03:25:30,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:30,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 8 letters. [2022-02-21 03:25:30,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 8 letters. [2022-02-21 03:25:30,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 8 letters. [2022-02-21 03:25:30,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:25:30,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 12 letters. Loop has 3 letters. [2022-02-21 03:25:30,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:25:30,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:25:30,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 15 letters. Loop has 8 letters. [2022-02-21 03:25:30,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:25:30,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:25:30,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 13 letters. Loop has 8 letters. [2022-02-21 03:25:30,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:25:30,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:30,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 8 letters. [2022-02-21 03:25:30,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:30,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:30,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 3 letters. [2022-02-21 03:25:30,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:30,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 8 letters. [2022-02-21 03:25:30,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 8 letters. [2022-02-21 03:25:30,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 8 letters. [2022-02-21 03:25:30,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:30,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 03:25:30,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:30,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:25:30,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 13 letters. Loop has 3 letters. [2022-02-21 03:25:30,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:25:30,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:25:30,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 3 letters. [2022-02-21 03:25:30,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:25:30,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:25:30,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 15 letters. Loop has 3 letters. [2022-02-21 03:25:30,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:25:30,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:25:30,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 12 letters. Loop has 3 letters. [2022-02-21 03:25:30,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:25:30,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:30,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 03:25:30,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:30,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:30,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 3 letters. [2022-02-21 03:25:30,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 62 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:30,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,530 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 03:25:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-02-21 03:25:30,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:30,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:25:30,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2022-02-21 03:25:30,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:30,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. cyclomatic complexity: 18 [2022-02-21 03:25:30,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:25:30,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 56 transitions. [2022-02-21 03:25:30,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-02-21 03:25:30,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-02-21 03:25:30,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2022-02-21 03:25:30,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:30,538 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2022-02-21 03:25:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2022-02-21 03:25:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2022-02-21 03:25:30,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:30,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states and 56 transitions. Second operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 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 03:25:30,543 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states and 56 transitions. Second operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 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 03:25:30,544 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 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 03:25:30,544 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:30,547 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-21 03:25:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-21 03:25:30,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:30,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:30,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 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 42 states and 56 transitions. [2022-02-21 03:25:30,550 INFO L87 Difference]: Start difference. First operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 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 42 states and 56 transitions. [2022-02-21 03:25:30,551 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:30,553 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-21 03:25:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-21 03:25:30,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:30,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:30,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:30,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 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 03:25:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-02-21 03:25:30,557 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-02-21 03:25:30,557 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-02-21 03:25:30,557 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:25:30,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2022-02-21 03:25:30,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:30,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:30,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:30,562 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:30,562 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:30,562 INFO L791 eck$LassoCheckResult]: Stem: 408#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 409#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 416#L14 assume !(build_nondet_String_~length~0#1 < 1); 417#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 435#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 419#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 420#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 412#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 413#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 432#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 422#L34-5 [2022-02-21 03:25:30,562 INFO L793 eck$LassoCheckResult]: Loop: 422#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 423#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 426#L34-3 assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; 422#L34-5 [2022-02-21 03:25:30,565 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 03:25:30,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:30,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2022-02-21 03:25:30,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:30,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824775220] [2022-02-21 03:25:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:30,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:30,609 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:30,633 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:30,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:30,633 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2022-02-21 03:25:30,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:30,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459355143] [2022-02-21 03:25:30,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:30,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:30,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:30,647 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:30,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:30,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2022-02-21 03:25:30,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:30,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304942923] [2022-02-21 03:25:30,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:30,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:30,676 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:30,702 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:31,342 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:31,343 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:31,343 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:31,343 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:31,343 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:31,343 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:31,344 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:31,344 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:31,344 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration4_Lasso [2022-02-21 03:25:31,344 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:31,344 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:31,347 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 03:25:31,349 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 03:25:31,351 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 03:25:31,352 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 03:25:31,354 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 03:25:31,356 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 03:25:31,357 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 03:25:31,359 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 03:25:31,360 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 03:25:31,362 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 03:25:31,739 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:25:31,740 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:25:31,744 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 03:25:31,746 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 03:25:31,747 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 03:25:31,749 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 03:25:31,750 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 03:25:31,752 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 03:25:31,753 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 03:25:31,755 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 03:25:31,757 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 03:25:32,593 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:32,593 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:32,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:32,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:32,597 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 03:25:32,598 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 03:25:32,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 03:25:32,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:32,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:32,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:32,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:32,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:32,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:32,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:32,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:32,623 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 03:25:32,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:32,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:32,625 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 03:25:32,626 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 03:25:32,627 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 03:25:32,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:32,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:32,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:32,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:32,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:32,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:32,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:32,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:32,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:25:32,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:32,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:32,650 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 03:25:32,651 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 03:25:32,652 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 03:25:32,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:32,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:32,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:32,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:32,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:32,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:32,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:32,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 03:25:32,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:32,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:32,685 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 03:25:32,692 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 03:25:32,693 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 03:25:32,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:32,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:32,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:32,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:32,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:32,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:32,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:32,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:32,714 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 03:25:32,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:32,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:32,715 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 03:25:32,716 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 03:25:32,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 03:25:32,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:32,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:32,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:32,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:32,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:32,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:32,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:32,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:32,740 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 03:25:32,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:32,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:32,741 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 03:25:32,742 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 03:25:32,744 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 03:25:32,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:32,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:32,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:32,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:32,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:32,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:32,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:32,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:32,774 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 03:25:32,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:32,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:32,776 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 03:25:32,776 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 03:25:32,777 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 03:25:32,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:32,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:32,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:32,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:32,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:32,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:32,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:32,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:32,799 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 03:25:32,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:32,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:32,801 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 03:25:32,802 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 03:25:32,803 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 03:25:32,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:32,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:32,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:32,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:32,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:32,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:32,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:32,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:32,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:25:32,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:32,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:32,839 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 03:25:32,879 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 03:25:32,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:32,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:32,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:32,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:32,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:32,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:32,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:32,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:32,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:32,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:32,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:32,915 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 03:25:32,916 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 03:25:32,918 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 03:25:32,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:32,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:32,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:32,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:32,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:32,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:32,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:32,972 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 03:25:32,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:32,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:32,974 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 03:25:32,990 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 03:25:32,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:32,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:32,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:32,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:32,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:32,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:32,999 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 03:25:33,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:33,044 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 03:25:33,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:33,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:33,046 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 03:25:33,048 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 03:25:33,049 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 03:25:33,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:33,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:33,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:33,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:33,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:33,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:33,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:33,083 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 03:25:33,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:33,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:33,084 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 03:25:33,085 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 03:25:33,086 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 03:25:33,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:33,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:33,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:33,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:33,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:33,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:33,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:33,128 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 03:25:33,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:33,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:33,131 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 03:25:33,132 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 03:25:33,134 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 03:25:33,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:33,141 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-02-21 03:25:33,141 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-02-21 03:25:33,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:33,194 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2022-02-21 03:25:33,194 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-02-21 03:25:33,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:33,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:25:33,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:33,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:33,284 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 03:25:33,284 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 03:25:33,286 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 03:25:33,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:33,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:33,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:33,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:33,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:33,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:33,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:33,349 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:25:33,349 INFO L444 ModelExtractionUtils]: 11 out of 49 variables were initially zero. Simplification set additionally 35 variables to zero. [2022-02-21 03:25:33,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:33,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:33,351 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 03:25:33,352 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 03:25:33,353 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:33,370 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:25:33,370 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:33,370 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_cstrspn_~s~0#1.base)_2) = -1*ULTIMATE.start_cstrspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0#1.base)_2 Supporting invariants [] [2022-02-21 03:25:33,386 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 03:25:33,427 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2022-02-21 03:25:33,430 INFO L390 LassoCheck]: Loop: "call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1;" "assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset;" [2022-02-21 03:25:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:33,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:33,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:33,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:33,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {626#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {626#unseeded} is VALID [2022-02-21 03:25:33,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {626#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {626#unseeded} is VALID [2022-02-21 03:25:33,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {626#unseeded} assume !(build_nondet_String_~length~0#1 < 1); {626#unseeded} is VALID [2022-02-21 03:25:33,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {626#unseeded} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {626#unseeded} is VALID [2022-02-21 03:25:33,492 INFO L290 TraceCheckUtils]: 4: Hoare triple {626#unseeded} main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {626#unseeded} is VALID [2022-02-21 03:25:33,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {626#unseeded} assume !(build_nondet_String_~length~0#1 < 1); {626#unseeded} is VALID [2022-02-21 03:25:33,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {626#unseeded} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {626#unseeded} is VALID [2022-02-21 03:25:33,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {626#unseeded} main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {626#unseeded} is VALID [2022-02-21 03:25:33,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {626#unseeded} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {626#unseeded} is VALID [2022-02-21 03:25:33,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {626#unseeded} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {626#unseeded} is VALID [2022-02-21 03:25:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:33,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:25:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:33,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:33,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {629#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|)))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {716#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:25:33,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {716#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {716#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:25:33,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {716#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; {684#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|)))))} is VALID [2022-02-21 03:25:33,530 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 03:25:33,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 03:25:33,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:33,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:33,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,541 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 03:25:33,541 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 03:25:33,583 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Result 81 states and 107 transitions. Complement of second has 5 states. [2022-02-21 03:25:33,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:33,583 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:33,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. cyclomatic complexity: 15 [2022-02-21 03:25:33,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:33,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:33,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 03:25:33,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:33,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:33,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:33,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 107 transitions. [2022-02-21 03:25:33,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:33,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:33,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:33,584 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 47 transitions. cyclomatic complexity: 15 [2022-02-21 03:25:33,585 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:33,585 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 03:25:33,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:33,585 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:33,585 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 81 states and 107 transitions. cyclomatic complexity: 32 [2022-02-21 03:25:33,585 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:33,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:33,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:33,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:33,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:33,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:33,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:33,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:33,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:33,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 32 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:33,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:25:33,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:25:33,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 32 Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:25:33,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:25:33,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:25:33,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 32 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:25:33,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:33,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:33,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 32 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:33,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:33,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:33,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:33,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:33,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:33,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:33,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:25:33,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:25:33,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:25:33,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:33,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:33,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:33,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:25:33,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:25:33,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 32 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:25:33,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:25:33,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:25:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 32 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:25:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 32 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:33,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,625 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 03:25:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-02-21 03:25:33,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:33,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:25:33,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:25:33,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:33,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. cyclomatic complexity: 32 [2022-02-21 03:25:33,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:33,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 61 states and 80 transitions. [2022-02-21 03:25:33,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:25:33,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:25:33,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 80 transitions. [2022-02-21 03:25:33,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:33,631 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2022-02-21 03:25:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 80 transitions. [2022-02-21 03:25:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2022-02-21 03:25:33,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:33,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states and 80 transitions. Second operand has 48 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 47 states have internal predecessors, (64), 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 03:25:33,634 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states and 80 transitions. Second operand has 48 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 47 states have internal predecessors, (64), 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 03:25:33,634 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 48 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 47 states have internal predecessors, (64), 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 03:25:33,634 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:33,636 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-02-21 03:25:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2022-02-21 03:25:33,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:33,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:33,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 47 states have internal predecessors, (64), 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 61 states and 80 transitions. [2022-02-21 03:25:33,637 INFO L87 Difference]: Start difference. First operand has 48 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 47 states have internal predecessors, (64), 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 61 states and 80 transitions. [2022-02-21 03:25:33,637 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:33,639 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-02-21 03:25:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2022-02-21 03:25:33,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:33,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:33,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:33,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 47 states have internal predecessors, (64), 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 03:25:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-02-21 03:25:33,640 INFO L704 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-02-21 03:25:33,641 INFO L587 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-02-21 03:25:33,641 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:25:33,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 64 transitions. [2022-02-21 03:25:33,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:33,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:33,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:33,641 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:33,642 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:33,642 INFO L791 eck$LassoCheckResult]: Stem: 811#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 812#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 818#L14 assume !(build_nondet_String_~length~0#1 < 1); 819#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 836#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 821#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 822#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 830#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 849#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 847#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 848#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 841#L34-1 assume !cstrspn_#t~short7#1; 842#L34-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 855#L34-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 854#L36 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 853#L31-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 852#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 832#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 824#L34-5 [2022-02-21 03:25:33,642 INFO L793 eck$LassoCheckResult]: Loop: 824#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 825#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 828#L34-3 assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; 824#L34-5 [2022-02-21 03:25:33,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:33,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2022-02-21 03:25:33,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:33,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255232492] [2022-02-21 03:25:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:33,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:33,645 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 03:25:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:33,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {1130#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1130#true} is VALID [2022-02-21 03:25:33,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {1130#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {1130#true} is VALID [2022-02-21 03:25:33,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {1130#true} assume !(build_nondet_String_~length~0#1 < 1); {1130#true} is VALID [2022-02-21 03:25:33,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {1130#true} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {1130#true} is VALID [2022-02-21 03:25:33,731 INFO L290 TraceCheckUtils]: 4: Hoare triple {1130#true} main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {1130#true} is VALID [2022-02-21 03:25:33,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {1130#true} assume !(build_nondet_String_~length~0#1 < 1); {1130#true} is VALID [2022-02-21 03:25:33,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {1130#true} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {1130#true} is VALID [2022-02-21 03:25:33,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {1130#true} main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {1130#true} is VALID [2022-02-21 03:25:33,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {1130#true} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1132#(= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) |ULTIMATE.start_cstrspn_#t~mem3#1|)} is VALID [2022-02-21 03:25:33,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {1132#(= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) |ULTIMATE.start_cstrspn_#t~mem3#1|)} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1133#(not (= |ULTIMATE.start_cstrspn_~c~0#1| 0))} is VALID [2022-02-21 03:25:33,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {1133#(not (= |ULTIMATE.start_cstrspn_~c~0#1| 0))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {1134#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|)) |ULTIMATE.start_cstrspn_#t~short7#1|)} is VALID [2022-02-21 03:25:33,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {1134#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|)) |ULTIMATE.start_cstrspn_#t~short7#1|)} assume !cstrspn_#t~short7#1; {1135#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:25:33,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {1135#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; {1135#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:25:33,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {1135#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {1136#(not (= |ULTIMATE.start_cstrspn_#t~mem9#1| |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:25:33,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {1136#(not (= |ULTIMATE.start_cstrspn_#t~mem9#1| |ULTIMATE.start_cstrspn_~c~0#1|))} assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; {1131#false} is VALID [2022-02-21 03:25:33,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {1131#false} cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; {1131#false} is VALID [2022-02-21 03:25:33,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {1131#false} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1131#false} is VALID [2022-02-21 03:25:33,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {1131#false} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1131#false} is VALID [2022-02-21 03:25:33,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:33,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:33,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255232492] [2022-02-21 03:25:33,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255232492] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:25:33,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:25:33,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:25:33,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51230377] [2022-02-21 03:25:33,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:25:33,735 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:25:33,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2022-02-21 03:25:33,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:33,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143586715] [2022-02-21 03:25:33,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:33,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:33,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:33,742 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:33,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:33,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:25:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:25:33,867 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. cyclomatic complexity: 21 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:33,983 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-02-21 03:25:33,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:25:33,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:33,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:33,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2022-02-21 03:25:33,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:33,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 54 states and 68 transitions. [2022-02-21 03:25:33,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:25:33,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:25:33,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 68 transitions. [2022-02-21 03:25:33,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:33,999 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 68 transitions. [2022-02-21 03:25:33,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 68 transitions. [2022-02-21 03:25:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-02-21 03:25:34,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:34,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states and 68 transitions. Second operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 48 states have internal predecessors, (63), 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 03:25:34,006 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states and 68 transitions. Second operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 48 states have internal predecessors, (63), 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 03:25:34,006 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 48 states have internal predecessors, (63), 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 03:25:34,007 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:34,008 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-02-21 03:25:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-02-21 03:25:34,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:34,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:34,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 48 states have internal predecessors, (63), 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 54 states and 68 transitions. [2022-02-21 03:25:34,009 INFO L87 Difference]: Start difference. First operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 48 states have internal predecessors, (63), 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 54 states and 68 transitions. [2022-02-21 03:25:34,009 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:34,013 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-02-21 03:25:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2022-02-21 03:25:34,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:34,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:34,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:34,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 48 states have internal predecessors, (63), 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 03:25:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-02-21 03:25:34,016 INFO L704 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-02-21 03:25:34,016 INFO L587 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-02-21 03:25:34,016 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:25:34,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2022-02-21 03:25:34,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:34,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:34,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:34,017 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:34,017 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:34,017 INFO L791 eck$LassoCheckResult]: Stem: 1207#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1208#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 1214#L14 assume !(build_nondet_String_~length~0#1 < 1); 1215#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 1234#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 1217#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 1218#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 1211#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 1212#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 1243#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 1240#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 1242#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 1236#L34-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 1209#L34-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 1210#L36 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 1213#L31-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 1216#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 1230#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 1220#L34-5 [2022-02-21 03:25:34,017 INFO L793 eck$LassoCheckResult]: Loop: 1220#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 1221#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 1224#L34-3 assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; 1220#L34-5 [2022-02-21 03:25:34,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2022-02-21 03:25:34,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:34,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169823232] [2022-02-21 03:25:34,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:34,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:34,047 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:34,071 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:34,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2022-02-21 03:25:34,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:34,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815286707] [2022-02-21 03:25:34,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:34,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:34,078 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:34,083 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:34,084 INFO L85 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2022-02-21 03:25:34,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:34,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382580527] [2022-02-21 03:25:34,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:34,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:34,115 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:34,126 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:35,316 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:35,316 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:35,316 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:35,316 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:35,316 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:35,316 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,316 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:35,316 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:35,316 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration6_Lasso [2022-02-21 03:25:35,316 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:35,316 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:35,318 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 03:25:35,321 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 03:25:35,323 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 03:25:35,325 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 03:25:35,327 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 03:25:35,329 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 03:25:35,330 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 03:25:35,333 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 03:25:35,335 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 03:25:35,336 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 03:25:35,338 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 03:25:35,339 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 03:25:35,341 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 03:25:35,343 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 03:25:35,878 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:25:35,881 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:25:35,886 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 03:25:35,887 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 03:25:35,890 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 03:25:35,891 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 03:25:35,893 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 03:25:36,994 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:36,994 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:36,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:36,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:36,995 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 03:25:37,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 03:25:37,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:37,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:37,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:37,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,026 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 03:25:37,028 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 03:25:37,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,030 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 03:25:37,031 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 03:25:37,032 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 03:25:37,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:37,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:37,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:37,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,058 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 03:25:37,059 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 03:25:37,060 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 03:25:37,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:37,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:37,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:37,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,081 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 03:25:37,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,083 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 03:25:37,084 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 03:25:37,085 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 03:25:37,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:37,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:37,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:37,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:37,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,127 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 03:25:37,129 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 03:25:37,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:37,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:37,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:37,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,151 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 03:25:37,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:25:37,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,162 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 03:25:37,162 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 03:25:37,164 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 03:25:37,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:37,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:37,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:37,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,189 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 03:25:37,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,200 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 03:25:37,216 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 03:25:37,216 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 03:25:37,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:37,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:37,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:37,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,240 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 03:25:37,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,242 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 03:25:37,243 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 03:25:37,244 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 03:25:37,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:37,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:37,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,284 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 03:25:37,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,285 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 03:25:37,289 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 03:25:37,290 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 03:25:37,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:37,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:37,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:37,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 03:25:37,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,314 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 03:25:37,315 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 03:25:37,317 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 03:25:37,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:37,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:37,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:37,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:25:37,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,344 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 03:25:37,345 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 03:25:37,346 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 03:25:37,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:37,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:37,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:37,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,370 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 03:25:37,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,373 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 03:25:37,373 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 03:25:37,375 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 03:25:37,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:37,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:37,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:37,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,396 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 03:25:37,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,397 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 03:25:37,400 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 03:25:37,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:37,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:37,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:37,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:37,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:25:37,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,424 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 03:25:37,425 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 03:25:37,426 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 03:25:37,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:37,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:37,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:37,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 03:25:37,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,451 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 03:25:37,452 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 03:25:37,453 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 03:25:37,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:37,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:37,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:37,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:37,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:37,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:37,483 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:37,510 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-02-21 03:25:37,511 INFO L444 ModelExtractionUtils]: 10 out of 49 variables were initially zero. Simplification set additionally 36 variables to zero. [2022-02-21 03:25:37,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,512 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 03:25:37,516 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 03:25:37,516 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:37,522 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:25:37,522 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:37,522 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3) = -1*ULTIMATE.start_cstrspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3 Supporting invariants [] [2022-02-21 03:25:37,538 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 03:25:37,603 INFO L297 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2022-02-21 03:25:37,610 INFO L390 LassoCheck]: Loop: "call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1;" "assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset;" [2022-02-21 03:25:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:25:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:37,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {1521#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1521#unseeded} is VALID [2022-02-21 03:25:37,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {1521#unseeded} is VALID [2022-02-21 03:25:37,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#unseeded} assume !(build_nondet_String_~length~0#1 < 1); {1521#unseeded} is VALID [2022-02-21 03:25:37,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {1521#unseeded} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {1521#unseeded} is VALID [2022-02-21 03:25:37,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {1521#unseeded} main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {1521#unseeded} is VALID [2022-02-21 03:25:37,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#unseeded} assume !(build_nondet_String_~length~0#1 < 1); {1521#unseeded} is VALID [2022-02-21 03:25:37,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {1521#unseeded} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {1648#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base| |ULTIMATE.start_build_nondet_String_#res#1.base|) unseeded)} is VALID [2022-02-21 03:25:37,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {1648#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base| |ULTIMATE.start_build_nondet_String_#res#1.base|) unseeded)} main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:37,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:37,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:37,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:37,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:37,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:37,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:37,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:37,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:37,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:37,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {1652#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1621#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:37,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {1622#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {1683#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:25:37,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {1683#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1683#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:25:37,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {1683#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; {1624#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))} is VALID [2022-02-21 03:25:37,792 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 03:25:37,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:37,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:37,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,803 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-02-21 03:25:37,804 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:37,890 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 79 states and 99 transitions. Complement of second has 7 states. [2022-02-21 03:25:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:37,891 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:37,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. cyclomatic complexity: 19 [2022-02-21 03:25:37,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:37,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:37,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:37,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:37,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:37,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:37,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 99 transitions. [2022-02-21 03:25:37,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:37,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:37,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:37,895 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 49 states and 63 transitions. cyclomatic complexity: 19 [2022-02-21 03:25:37,896 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:37,896 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:37,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:37,896 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:37,896 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 79 states and 99 transitions. cyclomatic complexity: 25 [2022-02-21 03:25:37,897 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:37,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:37,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 3 letters. Loop has 2 letters. [2022-02-21 03:25:37,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:37,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 79 letters. Loop has 79 letters. [2022-02-21 03:25:37,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 79 letters. Loop has 79 letters. [2022-02-21 03:25:37,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 79 letters. Loop has 79 letters. [2022-02-21 03:25:37,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 49 letters. Loop has 49 letters. [2022-02-21 03:25:37,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 49 letters. Loop has 49 letters. [2022-02-21 03:25:37,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 49 letters. Loop has 49 letters. [2022-02-21 03:25:37,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:37,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:37,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:37,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:25:37,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 19 letters. Loop has 3 letters. [2022-02-21 03:25:37,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:25:37,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:25:37,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 letters. Loop has 3 letters. [2022-02-21 03:25:37,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:25:37,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:37,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 3 letters. Loop has 2 letters. [2022-02-21 03:25:37,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:37,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:25:37,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 letters. Loop has 3 letters. [2022-02-21 03:25:37,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:25:37,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:25:37,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 19 letters. Loop has 3 letters. [2022-02-21 03:25:37,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:25:37,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,905 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 03:25:37,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:37,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,910 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:37,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:25:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:38,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {1521#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1521#unseeded} is VALID [2022-02-21 03:25:38,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {1521#unseeded} is VALID [2022-02-21 03:25:38,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#unseeded} assume !(build_nondet_String_~length~0#1 < 1); {1521#unseeded} is VALID [2022-02-21 03:25:38,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {1521#unseeded} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {1521#unseeded} is VALID [2022-02-21 03:25:38,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {1521#unseeded} main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {1521#unseeded} is VALID [2022-02-21 03:25:38,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#unseeded} assume !(build_nondet_String_~length~0#1 < 1); {1521#unseeded} is VALID [2022-02-21 03:25:38,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {1521#unseeded} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {1805#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base| |ULTIMATE.start_build_nondet_String_#res#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {1805#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base| |ULTIMATE.start_build_nondet_String_#res#1.base|) unseeded)} main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {1809#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1621#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:38,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:38,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:38,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {1622#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {1840#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:25:38,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {1840#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1840#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:25:38,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {1840#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; {1624#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))} is VALID [2022-02-21 03:25:38,071 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 03:25:38,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:38,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:38,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,081 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2022-02-21 03:25:38,082 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:38,176 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 03:25:38,188 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 79 states and 99 transitions. Complement of second has 7 states. [2022-02-21 03:25:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:38,188 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:38,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. cyclomatic complexity: 19 [2022-02-21 03:25:38,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:38,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:38,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:38,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:38,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:38,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:38,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 99 transitions. [2022-02-21 03:25:38,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:38,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:38,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:38,190 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 49 states and 63 transitions. cyclomatic complexity: 19 [2022-02-21 03:25:38,190 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:38,190 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:38,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:38,191 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:38,191 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 79 states and 99 transitions. cyclomatic complexity: 25 [2022-02-21 03:25:38,191 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:38,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:38,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 3 letters. Loop has 2 letters. [2022-02-21 03:25:38,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:38,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 79 letters. Loop has 79 letters. [2022-02-21 03:25:38,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 79 letters. Loop has 79 letters. [2022-02-21 03:25:38,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 79 letters. Loop has 79 letters. [2022-02-21 03:25:38,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 49 letters. Loop has 49 letters. [2022-02-21 03:25:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 49 letters. Loop has 49 letters. [2022-02-21 03:25:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 49 letters. Loop has 49 letters. [2022-02-21 03:25:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:38,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:25:38,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 19 letters. Loop has 3 letters. [2022-02-21 03:25:38,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:25:38,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:25:38,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 letters. Loop has 3 letters. [2022-02-21 03:25:38,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:25:38,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 3 letters. Loop has 2 letters. [2022-02-21 03:25:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:25:38,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 19 letters. Loop has 3 letters. [2022-02-21 03:25:38,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:25:38,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:25:38,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 letters. Loop has 3 letters. [2022-02-21 03:25:38,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 99 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:25:38,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,203 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 03:25:38,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,210 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:38,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:38,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:25:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:38,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:38,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {1521#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1521#unseeded} is VALID [2022-02-21 03:25:38,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {1521#unseeded} is VALID [2022-02-21 03:25:38,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#unseeded} assume !(build_nondet_String_~length~0#1 < 1); {1521#unseeded} is VALID [2022-02-21 03:25:38,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {1521#unseeded} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {1521#unseeded} is VALID [2022-02-21 03:25:38,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {1521#unseeded} main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; {1521#unseeded} is VALID [2022-02-21 03:25:38,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#unseeded} assume !(build_nondet_String_~length~0#1 < 1); {1521#unseeded} is VALID [2022-02-21 03:25:38,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {1521#unseeded} call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {1962#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base| |ULTIMATE.start_build_nondet_String_#res#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {1962#(and (= |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base| |ULTIMATE.start_build_nondet_String_#res#1.base|) unseeded)} main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {1966#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1621#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) unseeded)} is VALID [2022-02-21 03:25:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:38,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:38,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:38,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {1622#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {1997#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:25:38,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {1997#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1997#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:25:38,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {1997#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; {1624#(and (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))) (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_build_nondet_String_~nondetString~0#1.base|))} is VALID [2022-02-21 03:25:38,420 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 03:25:38,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:38,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:38,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,432 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-02-21 03:25:38,432 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:38,512 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 78 states and 102 transitions. Complement of second has 6 states. [2022-02-21 03:25:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:38,513 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:38,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. cyclomatic complexity: 19 [2022-02-21 03:25:38,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:38,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:38,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:38,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:38,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:38,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:38,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 102 transitions. [2022-02-21 03:25:38,514 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:38,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:38,514 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 49 states and 63 transitions. cyclomatic complexity: 19 [2022-02-21 03:25:38,514 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:38,514 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:38,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:38,514 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:38,514 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 78 states and 102 transitions. cyclomatic complexity: 29 [2022-02-21 03:25:38,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 102 transitions. cyclomatic complexity: 29 [2022-02-21 03:25:38,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:38,514 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:25:38,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 102 transitions. cyclomatic complexity: 29 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:38,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 3 letters. Loop has 2 letters. [2022-02-21 03:25:38,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 102 transitions. cyclomatic complexity: 29 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:38,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:25:38,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 78 letters. Loop has 78 letters. [2022-02-21 03:25:38,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 102 transitions. cyclomatic complexity: 29 Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:25:38,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 49 letters. Loop has 49 letters. [2022-02-21 03:25:38,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 49 letters. Loop has 49 letters. [2022-02-21 03:25:38,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 102 transitions. cyclomatic complexity: 29 Stem has 49 letters. Loop has 49 letters. [2022-02-21 03:25:38,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:38,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:38,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 102 transitions. cyclomatic complexity: 29 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:38,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 102 transitions. cyclomatic complexity: 29 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:25:38,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 19 letters. Loop has 3 letters. [2022-02-21 03:25:38,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 102 transitions. cyclomatic complexity: 29 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:25:38,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:25:38,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 letters. Loop has 3 letters. [2022-02-21 03:25:38,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 102 transitions. cyclomatic complexity: 29 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:25:38,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 63 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:38,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 3 letters. Loop has 2 letters. [2022-02-21 03:25:38,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 102 transitions. cyclomatic complexity: 29 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:38,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,521 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:25:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-21 03:25:38,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:25:38,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:25:38,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:25:38,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:38,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 102 transitions. cyclomatic complexity: 29 [2022-02-21 03:25:38,526 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:38,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2022-02-21 03:25:38,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:25:38,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:25:38,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:25:38,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:25:38,526 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:38,526 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:38,526 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:38,526 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:25:38,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:25:38,527 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:38,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:38,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:25:38 BoogieIcfgContainer [2022-02-21 03:25:38,533 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:25:38,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:25:38,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:25:38,533 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:25:38,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:26" (3/4) ... [2022-02-21 03:25:38,535 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:25:38,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:25:38,536 INFO L158 Benchmark]: Toolchain (without parser) took 12816.54ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 104.9MB in the beginning and 166.3MB in the end (delta: -61.4MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2022-02-21 03:25:38,536 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 37.2MB in the beginning and 37.1MB in the end (delta: 40.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:38,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.68ms. Allocated memory is still 138.4MB. Free memory was 104.6MB in the beginning and 113.2MB in the end (delta: -8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:25:38,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.09ms. Allocated memory is still 138.4MB. Free memory was 113.2MB in the beginning and 111.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:38,537 INFO L158 Benchmark]: Boogie Preprocessor took 47.48ms. Allocated memory is still 138.4MB. Free memory was 111.1MB in the beginning and 109.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:25:38,537 INFO L158 Benchmark]: RCFGBuilder took 286.50ms. Allocated memory is still 138.4MB. Free memory was 109.0MB in the beginning and 94.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:25:38,538 INFO L158 Benchmark]: BuchiAutomizer took 12234.66ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 94.4MB in the beginning and 166.3MB in the end (delta: -71.9MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2022-02-21 03:25:38,538 INFO L158 Benchmark]: Witness Printer took 2.32ms. Allocated memory is still 243.3MB. Free memory is still 166.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:38,539 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.15ms. Allocated memory is still 81.8MB. Free memory was 37.2MB in the beginning and 37.1MB in the end (delta: 40.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.68ms. Allocated memory is still 138.4MB. Free memory was 104.6MB in the beginning and 113.2MB in the end (delta: -8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.09ms. Allocated memory is still 138.4MB. Free memory was 113.2MB in the beginning and 111.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.48ms. Allocated memory is still 138.4MB. Free memory was 111.1MB in the beginning and 109.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 286.50ms. Allocated memory is still 138.4MB. Free memory was 109.0MB in the beginning and 94.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 12234.66ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 94.4MB in the beginning and 166.3MB in the end (delta: -71.9MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * Witness Printer took 2.32ms. Allocated memory is still 243.3MB. Free memory is still 166.3MB. 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[build_nondet_String()] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString] + -1 * s and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 10.0s. Construction of modules took 0.1s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 198 mSDsluCounter, 307 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 215 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 143 mSDtfsCounter, 215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital277 mio100 ax100 hnf100 lsp103 ukn72 mio100 lsp34 div129 bol100 ite100 ukn100 eq169 hnf93 smp84 dnf562 smp50 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 136ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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 03:25:38,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE